HDU 1143Tri Tiling&&POJ2663

题目在此
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 10466 Accepted: 5312
Description

In how many ways can you tile a 3xn rectangle with 2x1 dominoes?
Here is a sample tiling of a 3x12 rectangle.

Input

Input consists of several test cases followed by a line containing -1. Each test case is a line containing an integer 0 <= n <= 30.
Output

For each test case, output one integer number giving the number of possible tilings.
Sample Input

2
8
12
-1
Sample Output

3
153
2131

dp题目，dp[n] 一种分解情况是dp[n-2]*3，就是分出来的两块是独立的（三种放法），如果不独立就要前面的连着（如下图）

当dp[n] 划分成 2 和 n-2 后，再划分成 4和n-4时，4的部分，不能再划分成2 , 2 组合，这样就会和前面的2 和n-2 重复，同样，划分过2 ，n-2 以及 4, n-4 后，再划分 6, n-6时，也不能划分成 2，2,2 以及 2, 4或 4, 2，同理，划分成8, n-8….所以是2*(dp[n-4] + dp[n-6]…dp[0])即dp[n] = 3 * dp[n-2] + 2 * (dp[n-4] + dp[n-6]…dp[0]) 注意到 dp[n-2] = 3 * dp[n-4] + 2 * (dp[n-6] +…..dp[0]),得到最终的式子是dp[n] = 4 * dp[n-2] - dp[n-4];

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace ::std;

const int N = 30 + 10;
long long dp[N];

void Init() {
    dp[0] = 1;
    dp[1] = 0;
    dp[2] = 3;
    for (int i = 3; i <= 30; ++i) {
        if (i % 2 == 1)
            dp[i] = 0;
        else {
            dp[i] = 4 * dp[i - 2] - dp[i - 4];
        }
    }
    return;
}

int main() {
    int read;
    Init();
    while (~scanf("%d", &read)) {
        if (read == -1)
            break;
        else
            printf("%lld\n", dp[read]);
    }
    return 0;
}