Codeforces Round #202 (Div. 2)A
2013-10-24 14:45
309 查看
A:按给定的顺序排队买票,只有25、50、100三种面额的钱,问是否能够找零。
#include<iostream> #include<set> #include<map> #include<vector> #include<queue> #include<cmath> #include<climits> #include<cstdio> #include<string> #include<cstring> #include<algorithm> typedef long long LL; using namespace std; int n,a[100010]; int b[5]; int main() { while(cin>>n) { memset(b,0,sizeof(b)); bool flag=true; for(int i=0;i<n;i++) scanf("%d",&a[i]); for(int i=0;i<n;i++) { if(a[i]==25) b[0]++; if(a[i]==50) { if(b[0]<1) { flag=false; break; } b[0]--; b[1]++; } if(a[i]==100) { if(b[1]>=1) { b[1]--; if(b[0]>=1) b[0]--; else { flag=false; break; } } else if(b[0]>=3) { b[0]-=3; } else { flag=false; break; } b[2]++; } } if(flag) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0; }
相关文章推荐
- Codeforces Round #202 (Div. 2) D. Apple Tree (DFS + Math)
- Codeforces Round #202 (Div. 2) B. Color the Fence
- Codeforces Round #202 (Div. 2) B. Color the Fence
- Codeforces Round #202 (Div. 2) C. Mafia
- Codeforces Round #202 (Div. 1) D. Turtles dp
- Codeforces Round #202 (Div. 1) D. Turtles DP
- Codeforces Round #202 (Div. 2) B,C,D,E
- Codeforces Round #202 (Div. 2)
- Codeforces Round #202 (Div. 1) D. Turtles
- Codeforces Round #202 (Div. 1) A. Mafia 【二分】
- Codeforces Round #202 (Div. 1) A. Mafia
- Codeforces Round #202 (Div. 2)(A)贪心
- Codeforces Round #202 (Div. 2)
- Codeforces Round #202 (Div. 1) B. Apple Tree CF348B
- Codeforces Round #202 (Div. 2)(B)贪心,思维
- Codeforces Round #202 (Div. 1) A. Mafia 推公式 + 二分答案
- Codeforces Round #202 (Div. 2) B. Color the Fence(贪心)
- Codeforces Round #202 (Div. 2)C. Mafia(思维)
- Codeforces Round #202 (Div. 1) A. Mafia(二分,思路)
- Codeforces Round #202 (Div. 2) B.Color the Fence