hdoj5459Jesus Is Here【递推】

Jesus Is Here

Time Limit: 1500/1000 MS (Java/Others)    Memory Limit: 65535/102400 K (Java/Others)
Total Submission(s): 451    Accepted Submission(s): 324

Problem Description

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
  
  

 

很好的一道递推题利用与结果相关的值同时递推自己默默在哪推了几个小时最终还是没推出来

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define MOD 530600414
using namespace std;
const int maxn=201315;
struct Node{
	long long pos;//相邻两个c字符的距离差之和 
	long long ans;//所求答案 
	long long len;//每个字符串的长度 
	long long num;//每个字符串所含c字符的个数 
}A[maxn];
void dabiao(){
	A[5]={7,5,8,2};
	A[6]={20,16,13,3};
	for(int i=7;i<maxn;++i){
		A[i].len=(A[i-1].len+A[i-2].len)%MOD;
		A[i].num=(A[i-1].num+A[i-2].num)%MOD;
		A[i].pos=(A[i-2].pos+A[i-1].pos+(A[i-1].num*A[i-2].len)%MOD)%MOD;
		A[i].ans=(A[i-2].ans+A[i-1].ans+((A[i-2].len*A[i-2].num-A[i-2].pos)%MOD)*A[i-1].num+A[i-2].num*A[i-1].pos)%MOD;
	}
}
int main()
{
	dabiao();
	int t,i,j,k=1,n;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		printf("Case #%d: %d\n",k++,A[n].ans);
	}
	return 0;
}