A. Tetrahedron——中间计算过程会爆内存

简单版动态规划：不需要脑子，有眼睛就可以。
也不算吧，注意内存会爆

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define fep(i,a,b) for(int i=b;i>=a;--i)
#define mem(x,y) memset(x,y,sizeof(x))
#define inf 2147483647
const int mod = 1e9+7;
const int N = 1e7;
using namespace std;


int dp_a[N+10], dp_b[N+10], dp_c[N+10], dp_d[N+10];

void solve()
{
    int n;
    cin >> n;

    
    dp_a[1] = dp_b[1] = dp_c[1] = 1;

    rep(i,2,n){
    	dp_d[i] = (ll)((ll)(dp_a[i-1] + dp_b[i-1]) % mod + dp_c[i-1]) % mod; 
    	dp_a[i] = (ll)((ll)(dp_d[i-1] + dp_b[i-1]) % mod + dp_c[i-1]) % mod; 
    	dp_b[i] = (ll)((ll)(dp_d[i-1] + dp_a[i-1]) % mod + dp_c[i-1]) % mod; 
    	dp_c[i] = (ll)((ll)(dp_d[i-1] + dp_a[i-1]) % mod + dp_b[i-1]) % mod; 
    }
    cout << dp_d[n] % mod;
}




int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
        solve();
    return 0;
}

稍微复杂一点的：

1 – 0
2 – 3
3 – 6
4 – 21
发现：$f[i]=2\ast f[i-1]+3\ast f[i-2]$

#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
const int N = 1e7;
long long f[N+10];
int main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
	int n;
	cin >> n;
	f[1] = 0;
	f[2] = 3;
	f[3] = 6;
	f[4] = 21;
	for (int i = 5; i <= n; ++i)
	{
		f[i] = 2*f[i-1] + 3*f[i-2];
		f[i] %= mod;
	}
	cout << f[n];
	return 0;
}