Vacations(动态规划加贪心）

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天的情况，求人最少能休息几天：
ai = 0,如果第i个天假期健身房是封闭和不进行比赛;
ai = 1,如果第i个一天的假期健身房是封闭的,但比赛进行;
ai = 2,如果第i个一天的假期健身房开放和不进行比赛;
ai = 3,如果第i个一天的假期健身房是开放和比赛。
任意连续的两天不能连续健身或比赛
运用动态规划求解：
dp[i][j]是第i天做第j件事最少休息天数
#include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;
int main()
{int dp[1500][4];
int n,a[10000];
while(~scanf("%d",&n))
	{
		for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
		for(int i=1;i<=n;i++)
		for(int j=0;j<=3;j++)
		dp[i][j]=100000;
		for(int i=1;i<=n;i++)
		{
			if(a[i]==0)
			{
			dp[i][0]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]))+1;	
			} 
			if(a[i]==1)
			{
			dp[i][0]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]))+1;
			dp[i][2]=min(dp[i-1][0],dp[i-1][1]);	
			}
			if(a[i]==2)
			{	dp[i][0]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]))+1;
			dp[i][1]=min(dp[i-1][0],dp[i-1][2]);
				
			}
			if(a[i]==3)
			{
		dp[i][0]=min(dp[i-1][0],min(dp[i-1][1],dp[i-1][2]))+1;
		dp[i][2]=min(dp[i-1][0],dp[i-1][1]);
			dp[i][1]=min(dp[i-1][0],dp[i-1][2]);
			}
		}
		int ans;
		ans=min(dp[n][0],min(dp[n][1],dp[n][2]));
		printf("%d\n",ans);
		
	}
}