URAL 1225. Flags [递推DP求种类数]

1225. Flags Time limit: 1.0 second Memory limit: 64 MB On the Day of the Flag of Russia a shop-owner decided to decorate the show-window of his shop with textile stripes of white, blue and red colors. He wants to satisfy the following conditions: Stripes of the same color cannot be placed next to each other. A blue stripe must always be placed between a white and a red or between a red and a white one. Determine the number of the ways to fulfill his wish. Example. For N = 3 result is following: Input N, the number of the stripes, 1 ≤ N ≤ 45. Output M, the number of the ways to decorate the shop-window. Sample input output 3 4 Problem Source: 2002-2003 ACM Central Region of Russia Quarterfinal Programming Contest, Rybinsk, October 2002 Tags: dynamic programming  ( hide tags for unsolved problems) Difficulty: 41    Printable version    Submit solution    Discussion (37) All submissions (36573)    All accepted submissions (13990)    Solutions rating (10505)

#include<bits/stdc++.h>
#define ll long long
using namespace std;

/*三中颜色白、蓝、红分别用0、1、2表示，这样子初始化
dp[1][0] = dp[1][2] = 0;  只有一个条纹，不存在蓝色的情况；
（1）对于当前i条纹来说，如果是白色，
      决定条件是i - 1条纹是红色；
      若 i - 1条纹是蓝色，则i - 2条纹是红色；
（2）对于当前i条纹来说，如果是蓝色，
      决定条件是 i - 1条纹是白色或红色。。。
（3）对于当前i条纹来说，如果是红色，
      决定条件是i - 1条纹是白色；
      若 i - 1条纹是蓝色，则i - 2条纹是白色；
*/

int n;
ll dp[51][3];
void init()
{
    memset(dp, 0, sizeof(dp));
    dp[1][0] = 1; //白色;
    dp[1][2] = 1; //红色;
    for(int i = 2; i < 50; i++)
    {
        dp[i][0] += dp[i - 2][2] + dp[i - 1][2];
        dp[i][1] += dp[i - 1][0] + dp[i - 1][2];
        dp[i][2] += dp[i - 1][0] + dp[i - 2][0];
    }
}


int main()
{
    init();
    while(~scanf("%d",&n))
    {
        printf("%lld\n", dp[n][0]+dp[n][2]);
    }
    return 0;
}