Jesus Is Here HDU - 5459（思维）

I’ve sent Fang Fang around 201314 text messages in almost 5 years. Why can’t she make sense of what I mean?
But Jesus is here!" the priest intoned.Show me your messages."
Fine, the first message is s1=‘‘c" and the second one is s2=‘‘ff".
The i-th message is si=si−2+si−1 afterwards. Let me give you some examples.
s3=‘‘cff", s4=‘‘ffcff" and s5=‘‘cffffcff".

I found the i-th message's utterly charming," Jesus said.Look at the fifth message". s5=‘‘cffffcff" and two ‘‘cff" appear in it.
The distance between the first ‘‘cff" and the second one we said, is 5.
You are right, my friend," Jesus said.Love is patient, love is kind.
It does not envy, it does not boast, it is not proud. It does not dishonor others, it is not self-seeking, it is not easily angered, it keeps no record of wrongs.
Love does not delight in evil but rejoices with the truth.
It always protects, always trusts, always hopes, always perseveres."

Listen - look at him in the eye. I will find you, and count the sum of distance between each two different ‘‘cff" as substrings of the message.
Input
An integer T (1≤T≤100), indicating there are T test cases.
Following T lines, each line contain an integer n (3≤n≤201314), as the identifier of message.
Output
The output contains exactly T lines.
Each line contains an integer equaling to:
∑i<j:sn[i…i+2]=sn[j…j+2]=‘‘cff"(j−i) mod 530600414,

where sn as a string corresponding to the n-th message.
Sample Input
9
5
6
7
8
113
1205
199312
199401
201314
Sample Output
Case #1: 5
Case #2: 16
Case #3: 88
Case #4: 352
Case #5: 318505405
Case #6: 391786781
Case #7: 133875314
Case #8: 83347132
Case #9: 16520782

题意

求解任意两个字符c距离之和。

分析

每一个字符串都是由前面两个字符串组成 ，即s[i]=s[i-2]+s[i-1];所以易想到
ans[i]=(ans[i-1]+ans[i-2]+s[i-2]中的每个c到s[i-1]中每个c的距离)；

ll loca[maxn];//字符c的位置 之和
ll dis[maxn]; // 字符c距离末尾之和
ll sum_c[maxn];//字符c个数之和
ll sum_s[maxn];//字符串长度
ll ans[maxn]; //答案

因为每一个字符串都是由前面两个字符串组成 ，所以我们可以分成两部分来思考，例（ c f f f f c f f | f f c f f c f f f f c f f）
前面字符串中每个c到字符末尾的距离加后一个字符串中c到开头的距离即（ loca[maxn];//字符c的位置之和
dis[maxn]; // 字符c距离末尾之和 ）
1 3 | 3 6 11
第一个c：7+3+7+6+7+11
第二个c：2+3+2+6+2+11
所以（7+2）*3+（3+6+11）*2
仔细观察既可以得到3为后面字符串中c的个数；2为前面字符串中c的个数。
所以ans的递推公式：
ans[i]=(ans[i-1]+ans[i-2]+dis[i-2]*sum_c[i-1]+loca[i-1]*sum_c[i-2])；
然后在思考loca与dis的递推公式：
每个c的位置前面一个字符串不变后面字符串中每个c的位置加上前一个字符串长度即可
loca[i]=(loca[i-1]+loca[i-2]+sum_c[i-1]*sum_s[i-2]);
同理c距离末尾之和即后面字符串不变前面的加后面的长度
dis[i]=(dis[i-1]+dis[i-2]+sum_c[i-2]*sum_s[i-1])；

有了这几个递推公式就可以打表得出答案了。

注意：每一次递推都要取模哦！！！

#include<cstdio>
#define maxn 201314+10
#define mod 530600414
using namespace std; 
typedef long long ll;

ll loca[maxn];//字符c的位置 之和 
ll dis[maxn]; // 字符c距离末尾之和 
ll sum_c[maxn];//字符c个数之和 
ll sum_s[maxn];//字符串长度 
ll ans[maxn];
int main()
{
	int t,cnt=0,n;
	scanf("%d",&t);
	loca[3]=1,loca[4]=3;
	dis[3]=2,dis[4]=2;
	sum_c[3]=sum_c[4]=1,sum_c[5]=2;
	sum_s[3]=3,sum_s[4]=5,sum_s[5]=8;
	ans[3]=0,ans[4]=0;
	for(int i=5;i<=maxn;i++){
		loca[i]=(loca[i-1]+loca[i-2]+sum_c[i-1]*sum_s[i-2])%mod;
		dis[i]=(dis[i-1]+dis[i-2]+sum_c[i-2]*sum_s[i-1])%mod;
		sum_c[i]=(sum_c[i-1]+sum_c[i-2])%mod;
		sum_s[i]=(sum_s[i-1]+sum_s[i-2])%mod;
		ans[i]=(ans[i-1]+ans[i-2]+dis[i-2]*sum_c[i-1]+loca[i-1]*sum_c[i-2])%mod;
		ans[i]%=mod;
	}
	while(t--)
	{
		scanf("%d",&n);
		printf("Case #%d: %lld\n",++cnt,ans[n]);
	}
	return 0;
}