HDU.1708Fibonacci String（贪心）

Fibonacci String

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7711 Accepted Submission(s): 2566

Problem Description
After little Jim learned Fibonacci Number in the class , he was very interest in it.
Now he is thinking about a new thing – Fibonacci String .

He defines : str[n] = str[n-1] + str[n-2] ( n > 1 )

He is so crazying that if someone gives him two strings str[0] and str[1], he will calculate the str[2],str[3],str[4] , str[5]…

For example :
If str[0] = “ab”; str[1] = “bc”;
he will get the result , str[2]=“abbc”, str[3]=“bcabbc” , str[4]=“abbcbcabbc” …………;

As the string is too long ,Jim can’t write down all the strings in paper. So he just want to know how many times each letter appears in Kth Fibonacci String . Can you help him ?

Input
The first line contains a integer N which indicates the number of test cases.
Then N cases follow.
In each case,there are two strings str[0], str[1] and a integer K (0 <= K < 50) which are separated by a blank.
The string in the input will only contains less than 30 low-case letters.

Output
For each case,you should count how many times each letter appears in the Kth Fibonacci String and print out them in the format “X:N”.
If you still have some questions, look the sample output carefully.
Please output a blank line after each test case.

To make the problem easier, you can assume the result will in the range of int.

Sample Input
1
ab bc 3

Sample Output
a:1
b:3
c:2
d:0
e:0
f:0
g:0
h:0
i:0
j:0
k:0
l:0
m:0
n:0
o:0
p:0
q:0
r:0
s:0
t:0
u:0
v:0
w:0
x:0
y:0
z:0

将每次字符串中各个字符的用sum数组存起来，然后想家的时候利用滚动数组减少内存

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
using namespace std;
int main(){
	int t, k; cin >> t;
	while (t--){
		long long sum1[27] = { 0 }, sum2[27] = { 0 }, sum3[27] = { 0 };
		string s1, s2;
		cin >> s1 >> s2 >> k;
		for (int i = 0; i < s1.size(); i++)
			for (int j = 1; j < 27; j++)
				if (j == (s1[i] - 'a' + 1))
					sum1[j]++;
		for (int i = 0; i < s2.size(); i++)
			for (int j = 1; j < 27; j++)
				if (j == (s2[i] - 'a' + 1))
					sum2[j]++;
		if (k == 0){
			for (int i = 1; i < 27; i++)
				sum3[i] = sum1[i];
		}
		if (k == 1){
			for (int i = 1; i < 27; i++)
				sum3[i] = sum2[i];
		}
		else{
			for (int i = 3; i <= k + 1; i++){
				for (int j = 1; j < 27; j++){
					sum3[j] = sum2[j] + sum1[j];
					sum1[j] = sum2[j];
					sum2[j] = sum3[j];
				}
			}
		}
		for (int i = 1; i <= 26; i++){
			char ch;
			ch = 'a' - 1 + i;
			cout << ch << ":" << sum3[i] << endl;
		}
		cout << endl;
	}
	return 0;
}