CodeForces 698A Vacations（贪心）

Description
Vasya has n days of vacations! So he decided to improve his IT skills and do sport. Vasya knows the following information about each of this n days: whether that gym opened and whether a contest was carried out in the Internet on that day. For the i-th day there are four options:

on this day the gym is closed and the contest is not carried out;
on this day the gym is closed and the contest is carried out;
on this day the gym is open and the contest is not carried out;
on this day the gym is open and the contest is carried out.
On each of days Vasya can either have a rest or write the contest (if it is carried out on this day), or do sport (if the gym is open on this day).

Find the minimum number of days on which Vasya will have a rest (it means, he will not do sport and write the contest at the same time). The only limitation that Vasya has — he does not want to do the same activity on two consecutive days: it means, he will not do sport on two consecutive days, and write the contest on two consecutive days.

Input
The first line contains a positive integer n (1 ≤ n ≤ 100) — the number of days of Vasya's vacations.

The second line contains the sequence of integers a1, a2, ..., an (0 ≤ ai ≤ 3) separated by space, where:

ai equals 0, if on the i-th day of vacations the gym is closed and the contest is not carried out;
ai equals 1, if on the i-th day of vacations the gym is closed, but the contest is carried out;
ai equals 2, if on the i-th day of vacations the gym is open and the contest is not carried out;
ai equals 3, if on the i-th day of vacations the gym is open and the contest is carried out.
Output
Print the minimum possible number of days on which Vasya will have a rest. Remember that Vasya refuses:

to do sport on any two consecutive days,
to write the contest on any two consecutive days.
Sample Input
Input
4
1 3 2 0
Output
2
Input
7
1 3 3 2 1 2 3
Output
0
Input
2
2 2
Output

1

题意：Vasya放假了，每天他可以从三件事情里选择一件事情干，呆在家里，运动，或者打代码。

给你0～3表示体育馆还有机房是否开门。Vasya不喜欢连续两天做同样事情，告诉你每天所对应的数字（即机房和体育馆是否开门），问他最少可以休息几天。

思路：从第一个不是‘3’的天数开始判断（因为如果开始是3的话两个地方都可以去，而且不管明天是几都不会影响），如果这天数是‘3’判断他前面的数是多少，然后更新这天的数（a[i]-a[i-1]）这样如果昨天是1今天就是2昨天是2今天就是1昨天是0今天还是3.如果今天不是3，判断今天和昨天是否相等，如果相等冲突了记录今天为0（连续的话今天就要休息）。全部判断完后找数组里有多少个0就是最少休息几天。

代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	int a[101];
	scanf("%d",&n);
		for(int i=0;i<n;i++)
		{
		scanf("%d",&a[i]);
		}
		int ans=0;
		for(int i=1;i<n;i++)
		{
			if(a[i]==3)
			{
			if(a[i-1]==3)
			continue;
			else
			a[i]-=a[i-1];
			}
			else
			{	
				if(a[i]==a[i-1])
				a[i]=0;
			}
		}
		for(int i=0;i<n;i++)
		if(a[i]==0)
		ans++;
		printf("%d\n",ans);
	return 0;
}