啥都不说了...我好菜啊55555...
主要参考:https://www.jianshu.com/p/214d09476203
以下是较完整的解题思路:
附上正确源码:
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<math.h>
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int INF=0x3f3f3f3f;
#define ll long long
int n;
ll MOD=1000000007;
ll a[1005];
ll b[1005];
int main()
{
scanf("%d",&n);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
a[1]=1;b[1]=1;
a[2]=6;b[2]=2;
if(n==1)
{
printf("1");
return 0;
}
if(n==2)
{
printf("24");
return 0;
}
for(int i=3;i<=n;i++)
{
a[i]=2*a[i-1]+4*a[i-2]+2*b[i-1];
a[i]%=MOD;
b[i]=2*b[i-1];
b[i]%=MOD;
}
ll sum1=4*a[n]%MOD;
ll sum2=0;
for(int i=2;i<=n-1;i++)
{
sum2+=2*4*(b[i-1]*a[n-i]%MOD+b[n-i]*a[i-1]%MOD);
}
printf("%lld",(sum1+sum2)%MOD);
return 0;
}