Codeforces Round #202 (Div. 2)(A)贪心

来源:互联网 发布:及之而后知 编辑:程序博客网 时间:2024/05/21 11:32

A. Cinema Line
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

The new "Die Hard" movie has just been released! There are n people at the cinema box office standing in a huge line. Each of them has a single 10050 or 25 ruble bill. A "Die Hard" ticket costs 25 rubles. Can the booking clerk sell a ticket to each person and give the change if he initially has no money and sells the tickets strictly in the order people follow in the line?

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of people in the line. The next line contains n integers, each of them equals2550 or 100 — the values of the bills the people have. The numbers are given in the order from the beginning of the line (at the box office) to the end of the line.

Output

Print "YES" (without the quotes) if the booking clerk can sell a ticket to each person and give the change. Otherwise print "NO".

Sample test(s)
input
425 25 50 50
output
YES
input
225 100
output
NO
input
450 50 25 25
output
NO





题意:有一群人排队买票,一张票25块钱,开始售票处没有钱,每个人持着25,50,100的面值去购票,问售票处能否完成这个队伍的购票



题解:直接模拟一下就好



#include <set>#include <map>#include <list> #include <cmath> #include <queue> #include <vector>#include <cstdio> #include <string> #include <cstring>#include <iomanip> #include <iostream> #include <sstream>#include <algorithm>#define  LL long long #define  N 100005using namespace std; int main(){#ifdef CDZSCfreopen("i.txt","r",stdin);#endifint n,x;while(~scanf("%d",&n)){int ok=1;int a25=0;int a50=0;int a100=0;for(int i=0;i<n;i++){scanf("%d",&x);x-=25;if(x==0){a25++;x=0;}if(x==25&&a25>0){x=0;a50++;a25--;}if(x==75){if(a50>0&&a25>0&&x){x=0;a50--;a25--;}if(x&&a25>=3){a25-=3;x=0;}}if(x>0)ok=0;}puts(ok?"YES":"NO");}return 0;}









0 0
原创粉丝点击