第十三届蓝桥杯C++ B组试题G题解

本题解时间和空间复杂度均为O(n),输入最大值10000000也只需要0.078s左右


容易看出此问题具有最优子结构性质，适合用动态规划算法求解。
dp[n]即为填满2*n的画布的不同方案数

#include <bits/stdc++.h>
using namespace std;
int N;
long long dp[10000001];

int main()
{
    dp[0] = 1;
    dp[1] = 1;
    dp[2] = 2;
    cin >> N;
    // clock_t start, end;
    // start = clock();
    // 时间复杂度O(n)
    for (int i = 3; i <= N; ++i)
        dp[i] = (dp[i - 1] * 2 + dp[i - 3]) % 1000000007;
    cout << dp[N] << endl;
    // end = clock();
    // cout << "this program's run time is " << double(end - start) / CLOCKS_PER_SEC << endl;
    return 0;
}

还可以将空间复杂度进一步简化为O(1)

#include <bits/stdc++.h>
using namespace std;
int N;
// long long dp[1e7+1];
long long dp[4];

int main()
{
    dp[0] = 1;
    dp[1] = 1;
    dp[2] = 2;
    cin >> N;
    clock_t start, end;
    start = clock();

    // 时间复杂度O(n)
    // for (int i = 3; i <= N; ++i)
    //     dp[i] = (dp[i - 1] * 2 + dp[i - 3]) % 1000000007;

    // 进一步将空间复杂度简化为O(1)
    for (int i = 3; i <= N; ++i)
    {
        dp[3] = (dp[2] * 2 + dp[0]) % 1000000007;
        dp[0] = dp[1];
        dp[1] = dp[2];
        dp[2] = dp[3];
    }
    cout << dp[3] << endl;
    // cout << dp[N] << endl;

    end = clock();
    cout << "this program's run time is " << double(end - start) / CLOCKS_PER_SEC << endl;
    return 0;
}