uva 1623——Enter The Dragon
2015-11-01 21:18
453 查看
题意:有n个装满水的湖,可以预知将来m天下雨情况,每次下满一个湖,或者不下,不下雨的时候可以让某个湖变干,问是否存在一种方案使得每次下雨之前湖总是干的。
思路:贪心。什么时候下雨,就什么时候在下雨之前把湖变干。实际上就是找该湖上一次满后的第一个不下雨的日子来把它变干。
code:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int INF=0x3fffffff;
const int inf=-INF;
const int N=1000005;
const int M=2005;
const int mod=1000000007;
const double pi=acos(-1.0);
#define cls(x,c) memset(x,c,sizeof(x))
#define cpy(x,a) memcpy(x,a,sizeof(a))
#define fr(i,s,n) for (int i=s;i<=n;i++)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define mk make_pair
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
int v
,la
,s
;
set<int>ep;
set<int>::iterator p;
int main()
{
int T,n,m,f;
scanf("%d",&T);
while (T--)
{
cls(s,0);cls(la,0);f=0;
ep.clear();
scanf("%d %d",&n,&m);
fr(i,0,m-1)
{
scanf("%d",&v[i]);
if (f) continue;
if (!v[i]) ep.insert(i);//cout<<i<<endl;
else
{
p=ep.lower_bound(la[v[i]]);
if (p==ep.end()) f=1;
else
{
//cout<<*p<<endl;
s[*p]=v[i];
la[v[i]]=i;
ep.erase(p);
}
}
}
if (f) puts("NO");
else
{
puts("YES");
fr(i,0,m-1)
{
if (!v[i]) printf("%d ",s[i]);
}
puts("");
}
}
}
思路:贪心。什么时候下雨,就什么时候在下雨之前把湖变干。实际上就是找该湖上一次满后的第一个不下雨的日子来把它变干。
code:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int INF=0x3fffffff;
const int inf=-INF;
const int N=1000005;
const int M=2005;
const int mod=1000000007;
const double pi=acos(-1.0);
#define cls(x,c) memset(x,c,sizeof(x))
#define cpy(x,a) memcpy(x,a,sizeof(a))
#define fr(i,s,n) for (int i=s;i<=n;i++)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define mk make_pair
#define IN freopen("in.txt","r",stdin);
#define OUT freopen("out.txt","w",stdout);
int v
,la
,s
;
set<int>ep;
set<int>::iterator p;
int main()
{
int T,n,m,f;
scanf("%d",&T);
while (T--)
{
cls(s,0);cls(la,0);f=0;
ep.clear();
scanf("%d %d",&n,&m);
fr(i,0,m-1)
{
scanf("%d",&v[i]);
if (f) continue;
if (!v[i]) ep.insert(i);//cout<<i<<endl;
else
{
p=ep.lower_bound(la[v[i]]);
if (p==ep.end()) f=1;
else
{
//cout<<*p<<endl;
s[*p]=v[i];
la[v[i]]=i;
ep.erase(p);
}
}
}
if (f) puts("NO");
else
{
puts("YES");
fr(i,0,m-1)
{
if (!v[i]) printf("%d ",s[i]);
}
puts("");
}
}
}
相关文章推荐
- 背包问题
- 贪心法删数问题
- Moving Tables
- Tian Ji -- The Horse Racing
- Saving HDU
- 悼念512汶川大地震遇难同胞——老人是真饿了
- 贪心法求解背包问题(物品可分)
- 贪心法求解背包问题(部分背包 物品可分)
- poj 1328:Radar Installation
- POJ 3069
- Best Time to Buy and Sell Stock
- ACM入门题目(北大ACM教材)
- C陷阱与缺陷笔记
- uva679 Dropping Balls 入门经典II 第六章数据结构基础 例题6-6
- uva839 - Not so Mobile 入门经典II 第六章数据结构基础 例题6-9
- uva120 Stacks of Flapjacks 入门经典II 第八章例题8-1
- uvaoj 11796 - Dog Distance
- uvaoj 10795 - A Different Task
- uvaoj 1030 - Image Is Everything
- uvaoj 10859 - Placing Lampposts