Coupons and Discounts(水题)
来源:互联网 发布:剑三苍云成男捏脸数据 编辑:程序博客网 时间:2024/05/18 18:45
Description
The programming competition season has already started and it's time to train for ICPC. Sereja coaches his teams for a number of year and he knows that to get ready for the training session it's not enough to prepare only problems and editorial. As the training sessions lasts for several hours, teams become hungry. Thus, Sereja orders a number of pizzas so they can eat right after the end of the competition.
Teams plan to train for n times during n consecutive days. During the training session Sereja orders exactly one pizza for each team that is present this day. He already knows that there will be ai teams on the i-th day.
There are two types of discounts in Sereja's favourite pizzeria. The first discount works if one buys two pizzas at one day, while the second is a coupon that allows to buy one pizza during two consecutive days (two pizzas in total).
As Sereja orders really a lot of pizza at this place, he is the golden client and can use the unlimited number of discounts and coupons of any type at any days.
Sereja wants to order exactly ai pizzas on the i-th day while using only discounts and coupons. Note, that he will never buy more pizzas than he need for this particular day. Help him determine, whether he can buy the proper amount of pizzas each day if he is allowed to use only coupons and discounts. Note, that it's also prohibited to have any active coupons after the end of the day n.
Input
The first line of input contains a single integer n (1 ≤ n ≤ 200 000) — the number of training sessions.
The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 10 000) — the number of teams that will be present on each of the days.
Output
If there is a way to order pizzas using only coupons and discounts and do not buy any extra pizzas on any of the days, then print "YES" (without quotes) in the only line of output. Otherwise, print "NO" (without quotes).
Sample Input
41 2 1 2
YES
31 0 1
NO
Hint
In the first sample, Sereja can use one coupon to buy one pizza on the first and the second days, one coupon to buy pizza on the second and the third days and one discount to buy pizzas on the fourth days. This is the only way to order pizzas for this sample.
In the second sample, Sereja can't use neither the coupon nor the discount without ordering an extra pizza. Note, that it's possible that there will be no teams attending the training sessions on some days.
贪心算法,对于当前的每个数字,只考虑它的下一个数字的情况。
#include<stdio.h> #include<cstring>#include<cmath>#include<iostream>using namespace std;int main(){int n,a[200005];int sum=0,flag=0;scanf("%d",&n);for(int i=0;i<n;i++){scanf("%d",&a[i]);}for(int i=0;i<n;i++){if(a[i]%2){if(!a[i+1]){flag=1;break;}a[i+1]--;}}if(flag)printf("NO\n");else if(a[n-1]%2==0)printf("YES\n");elseprintf("NO\n");return 0;}
- Coupons and Discounts(水题)
- Coupons and Discounts(细节题)
- B. Coupons and Discounts
- 【贪心】Coupons and Discounts
- Codeforces B. Coupons and Discounts
- CodeForces 731B-Coupons and Discounts(贪心 模拟)
- CodeForces 731 B.Coupons and Discounts(水~)
- 【codeforces 710 B Coupons and Discounts】
- 【50.49%】【codeforces 731B】Coupons and Discounts
- Codeforces 731 B. Coupons and Discounts【贪心】
- Codeforce 731B. Coupons and Discounts
- CodeForces 731B Coupons and Discounts
- CodeForces 731B 之 Coupons and Discounts
- Codeforces 731 B. Coupons and Discounts
- codeforces 731B Coupons and Discounts
- Codeforces Round #376 (Div. 2) B. Coupons and Discounts(贪心)
- Codeforces Round #376 (Div. 2) B. Coupons and Discounts
- Codeforces Round #376 (Div. 2) B. Coupons and Discounts
- Docker之下载镜像
- 对数字(或者中文+数字)进行排序,非数组排序2
- 穿越宋朝, 年薪 80 万的工程师身价值多少?
- python基于http协议编程:httplib,urllib和urllib2
- xcode unable to boot the simulator解决方法
- Coupons and Discounts(水题)
- 功能强大的 Vitamio 视频播放器的使用教程
- 真机调试无法安装 The application does not have a valid signature.
- 机器学习、深度学习的理论与实战入门建议整理(三)
- vector的使用
- switch结构
- SAP 日志管理
- 07上机练习3
- napi