【codefors】贪心

Vacations

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

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:

1. on this day the gym is closed and the contest is not carried out;
2. on this day the gym is closed and the contest is carried out;
3. on this day the gym is open and the contest is not carried out;
4. 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 a₁, a₂, ..., a_n (0 ≤ a_i ≤ 3) separated by space, where:

• a_i equals 0, if on the i-th day of vacations the gym is closed and the contest is not carried out;
• a_i equals 1, if on the i-th day of vacations the gym is closed, but the contest is carried out;
• a_i equals 2, if on the i-th day of vacations the gym is open and the contest is not carried out;
• a_i 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

题意：已知一个长度为n的0~3的序列，表示接下来n天能做的活动序号。

                                  0表示不能做运动，也不能打比赛；1表示不能做运动，但能打比赛；

  2表示能做运动，但不能打比赛；3表示能做运动，也能打比赛。

要求连续两天不能做相同的活动，无法达到要求时就休息，求最短的休息天数。

解题思路：

0的时候一定是休息的，3的时候有多种选择，但肯定和前一天做的活动不能相同，于是判断前一天在干嘛，如果前一天是1，那么此时的3就换成2；同理，如果前一天是2，那么此时的3就换成1。于是只要判断前一天的活动是否和今天的相同即可，如果前一天是3，那么无论如何都不会相同，3有两种选择嘛。

int a[110];放到main函数里面竟然WA了，要不是对比了一下，还真不知道是这问题，太坑。。。 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

#include<stdio.h>
int a[110]; 
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		int t=0;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==0)//只能休息
			t++;
			else if(i!=0&&a[i]==3)
			{
			if(a[i-1]==1)    a[i]=2;  //前一天是1，那么今天只能是2  
			else if(a[i-1]==2)    a[i]=1;//前一天是2.那么今天只能是1 
			}
			else if(a[i]==a[i-1]&&a[i-1]!=3)//前一天的活动和今天的相同，只能休息
			{
			a[i]=0;
			t++;	
			}
		}
		printf("%d\n",t);
	}
	
	return 0;
}