1一开始我用常见的方法
#include<bits/stdc++.h>
using namespace std;
long long s(long long a) {
if (a == 1) return 1;
else if (a == 2) return 2;
else return (2 * s(a - 1) + s(a - 2))% 32767;
}
int main() {
long long a;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a;
cout << s(a) << endl;
}
return 0;
}
运行时长1000s(;´д`)ゞ转念一想数组
#include <bits/stdc++.h>
using namespace std;
int a[1000005];
int main()
{
int n, b;
a[1] = 1, a[2] = 2;
for(int i = 3; i <= 1000000; ++i)
a[i] = (2*a[i-1] + a[i-2])%32767;
cin >> n;
for(int i = 1; i <= n; ++i)
{
cin >> b;
cout << a[b] << endl;
}
return 0;
}