hdu 2569 彼岸 简单dp

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
const int inf=0x3f3f3f3f;
const int mod=1e9+7;
ll a[maxn];
int main()
{
    int t,n,m;
    a[0]=1;
    a[1]=3;
    a[2]=9;
    for(int i=3;i<=40;i++)
        a[i]=a[i-2]*3+(a[i-1]-a[i-2])*2;
    scanf("%d",&t);
    while(t--&&scanf("%d",&n)!=EOF)
        printf("%lld\n",a[n]);
    return 0;
}