Codeforces Round #363 (Div. 2) C. Vacations

 

简单贪心

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<string>
#include<map>
using namespace std;
#define INF 1e9+5
#define N 1100
int a[N];
int main()
{
	    int  n, i,count;
        scanf("%d", &n);
		memset(a, 0, sizeof(a));
		for ( i = 1; i <= n; i++)
		{
			scanf("%d", &a[i]);
		}
		for ( i = 1,count = 0;i <= n; i++)
		{   
			if (a[i]==0)                    {           count++; continue; }
			if (a[i] == 1 && a[i - 1] == 2) {                    continue; }
			if (a[i] == 2 && a[i - 1] == 1) {                    continue; }
			if (a[i] == 3 && a[i - 1] == 1) { a[i] = 2;          continue; }
			if (a[i] == 3 && a[i - 1] == 2) { a[i] = 1;          continue; }
			if (a[i] == 1 && a[i - 1] == 1) { a[i] = 0; count++; continue; }
			if (a[i] == 2 && a[i - 1] == 2) { a[i] = 0; count++; continue; }
		}
		printf("%d\n",count);
	//system("pause");
 	return 0;
}