2016 北邮暑期训练3-D题（Codeforces 698A Vacations）DP，水题

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

题目大意：

Vaysa有n天假期，其中每一天有4种情况：0表示体育馆和比赛都没有，1表示有比赛没有体育馆，2表示有体育馆没有比赛，3表示都有。她希望能最高效的利用时间，尽可能的休息。但她要求不能连续两天做同样的事情，求最少的休息时间。

题目分析：

其实跟LeetCode里面卖股票的差不多，也是一下子想到用dp来解决。首先考虑转移方程和初始条件：
设dp[i][j]表示第i天做事情j的最小休息时间（其中j=0表示啥也不干，j=1表示做体育运动，j=2表示参加比赛）。则转移方程如下：

dp[i][0]=min{dp[i-1][j]+1},j∈{0,1,2} //第i天啥也不干，那么就是前几天的休息时间的最小值加上第i天休息
dp[i][1]=min{dp[i-1][0],dp[i-1][2]}, if 第i天体育馆开放
             INF ，if第i天体育馆未开放
dp[i][2]=min{dp[i-1][0],dp[i-1][1]}, if 第i天比赛开放
             INF ，if第i天比赛未开放
//其实也好理解，如果没开放，这种情况就不存在，用无穷大表示（如果用0表示在后面的递推过程中就会出问题）

接下来初始条件令dp[0][0]=0,其他为INF。因为第0天视为都没开放，所以第0天做体育运动和参加比赛都是没有意义的，设为INF。

AC代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define INFINITY 0x3f3f3f3f
int min(int a,int b,int c) {
  int m=(a<b)?a:b;
  m=(m<c)?m:c ;
  return m ;
}
int main() {
  int a[111];
  int dp[111][3];
  int n;

  memset(a,0,sizeof(a));
  memset(dp,0x3f,sizeof(dp));
  dp[0][0]=0;
  scanf("%d", &n);
  for(int i=1;i<=n;i++)
    scanf("%d", &a[i]);
  for(int i=1;i<=n;i++) {
    dp[i][0]=min(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1;
    if(a[i]==2||a[i]==3)
      dp[i][1]=min(dp[i-1][0],dp[i-1][2]);
    if(a[i]==1||a[i]==3)
      dp[i][2]=min(dp[i-1][0],dp[i-1][1]);
  }

  printf("%d\n", min(dp[n][0],dp[n][1],dp[n][2]));
  return 0;
}

说是水题，但在Leetcode里面应该也能算上一道Medium难度。