CodeForces 731B-Coupons and Discounts（贪心 模拟）

B. Coupons and Discounts
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
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).

Examples
input
4
1 2 1 2
output
YES
input
3
1 0 1
output
NO
Note
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.

题意：给出N个ai，代表第i天买ai个披萨，有两种优惠的方法买到披萨，一次买两个，或者连续两天买一个，在同一天这两种方法可以反复使用。也就是说如果ai=4，那么我买两次一次买两个即可，如果ai=5，我可以买两次一次买两个，再采用第二种优惠第i天买一个，i+1天再买一个。判断是否可以用这两种优惠的方法买到全部披萨。要求每天都买不多不多少刚刚好ai个披萨

思路：对于每一个ai，如果是偶数，直接第一种方法即可，如果是奇数，i+1天的数量减一，然后检查每个ai是否合法即可。

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
const int maxn=200005;
int main()
{
    int num[maxn];
    int N;
    scanf("%d",&N);
    for(int i=0; i<N; i++)
        scanf("%d",&num[i]);
    num[N]=0;
    for(int i=0; i<=N; i++)
    {
        if(num[i]%2==0)
            num[i]=0;
        else
        {
            num[i]=0;
            if(num[i+1]>0)
                num[i+1]--;
            else
            {
                printf("NO\n");
                return 0;
            }
        }
    }
    printf("YES\n");
    return 0;
}