动态规划-vacations

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.

Example

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

Note

In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days.

In the second test Vasya should write contests on days number 1, 3, 5 and 7, in other days do sport. Thus, he will not have a rest for a single day.

In the third test Vasya can do sport either on a day number 1 or number 2. He can not do sport in two days, because it will be contrary to the his limitation. Thus, he will have a rest for only one day.

解题思路：dp问题，还是用到了二维数组dp[i][j]来表示第i天做j事的最小休息天数，其中j为0,1,2。0表示第i天什么都没做，此时休息天数+1，1表示做了运动，2表示参加了考试。于是状态转移方程就是 ：dp[i][0]=min(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1;

dp[i][1]=min(dp[i-1][0],dp[i-1][2]);dp[i][2]=min(dp[i-1][0],dp[i-1][1]);

这里需要注意的是dp[][]的初始赋值，要赋值为无穷大，因为是求最小的天数，但是dp[0][0]是从这里开始计算的，所以dp[0][0]=0；

AC代码：

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int dp[105][3];
int n;
int a[105];
int mi(int a, int b, int c)
{
	if (a <= b&&a <= c) return a;
	else if (b <= a&&b <= c) return b;
	else return c;
}
int main()
{
	scanf("%d", &n);
	memset(dp, 0x3f, sizeof(dp));
	for (int i = 1; i <= n; i++)
	{
		scanf("%d", &a[i]);
	}
	dp[0][0] = 0;
	for (int i = 1; i <= n; i++)
	{
		dp[i][0] = mi(dp[i - 1][0], dp[i - 1][1], dp[i - 1][2]) + 1;
		if (a[i] == 1 || a[i] == 3)
		{
			dp[i][1] = min(dp[i - 1][0], dp[i - 1][2]);
		}
		if (a[i] == 2 || a[i] == 3)
		{
			dp[i][2] = min(dp[i - 1][0], dp[i - 1][1]);
		}
	}
	printf("%d\n", mi(dp[n][0], dp[n][1], dp[n][2]));
	return 0;
}

这里就是这个题的解题啦，算是中等难度~多加练习就好