题意:
给出一个类似于斐波那契数组的字符串的定义,给出一个n,让求第n个串中任意两个c的距离的和。
思路:
我们用了三个小时找规律,最后发现是递推。。。
代码:
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
const int maxn = 201500;
const long long mod= 530600414;
struct Node {
long long num3, num5, num;
long long leftlen, rightlen;
long long ans;
long long di;
}node[maxn];
int main()
{
node[0].num3 = 1;
node[0].num5 = 1;
node[0].num = 2;
node[0].leftlen = 5;
node[0].rightlen = 5;
node[0].ans = 5;
node[0].di=5;
node[1].di=8;
node[1].num3 = 2;
node[1].num5 = 1;
node[1].num = 3;
node[1].leftlen = 13;
node[1].rightlen = 11;
node[1].ans = 16;
for (int i = 2; i < 201500; i++) {
if (i % 2 == 0) {
node[i-2].num3--;
node[i-2].num3=(node[i-2].num3+mod)%mod;
node[i-2].num5++;
node[i-2].num5%=mod;
long long tans = 0;
tans += node[i-2].ans;
tans%=mod;
tans += node[i-1].ans;
tans%=mod;
tans += (node[i-1].num * node[i-2].leftlen)%mod + (node[i-2].num * node[i-1].rightlen)%mod + (5 * (node[i-1].num * node[i-2].num)%mod);
tans%=mod;
node[i].rightlen =node[i-1].rightlen+node[i-2].rightlen+(node[i-2].di+5)*(node[i-1].num);
node[i].rightlen%=mod;
node[i].leftlen = (node[i-1].leftlen) +node[i-2].leftlen+(node[i-1].di+5)*(node[i-2].num);
node[i].leftlen%=mod;
node[i].num = node[i-1].num + node[i-2].num;
node[i].num%=mod;
node[i].di=node[i-1].di+node[i-2].di+5;
node[i].di%=mod;
node[i].num3 = node[i-1].num3 + node[i-2].num3;
node[i].num3%=mod;
node[i].num5 = node[i-1].num5 + node[i-2].num5;
node[i].num5%=mod;
node[i].ans = tans;
node[i].ans%=mod;
}
else {
long long tans = 0;
tans += node[i-2].ans;
tans%=mod;
tans += node[i-1].ans;
tans%=mod;
tans += (node[i-1].num * node[i-2].leftlen)%mod + (node[i-2].num * node[i-1].rightlen)%mod + (3 * (node[i-1].num * node[i-2].num)%mod);
tans%=mod;
node[i].rightlen =node[i-1].rightlen+node[i-2].rightlen+(node[i-2].di+3)*(node[i-1].num);
node[i].rightlen%=mod;
node[i].leftlen = (node[i-1].leftlen) +node[i-2].leftlen+(node[i-1].di+3)*(node[i-2].num);
node[i].leftlen%=mod;
node[i].num = node[i-1].num + node[i-2].num;
node[i].num%=mod;
node[i].di=node[i-1].di+node[i-2].di+3;
node[i].di%=mod;
node[i].num3 = node[i-1].num3 + node[i-2].num3;
node[i].num3%=mod;
node[i].num5 = node[i-1].num5 + node[i-2].num5;
node[i].num5%=mod;
node[i].ans = tans;
node[i].ans%=mod;
}
}
int t;
scanf("%d", &t);
int cas=1;
while (t--) {
int n;
scanf("%d", &n);
printf("Case #%d: %I64d\n",cas++, node[n-5].ans);
}
return 0;
}