开始写的版本是tle的,没有考虑到1000倍数的优化还有把memset放在了循环里;之后就将year的循环去掉,直接用V来表示可能最大的本金+利息;
先上tle代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=11;
const int Maxn=50000;
int val[maxn],interest[maxn],dp[Maxn];
int main()
{
int T;
scanf("%d",&T);
while(T--){
int n,m,year;
scanf("%d%d",&m,&year);
int V=m*pow(1.1,(double)year)/1000;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&val[i],&interest[i]);
}
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
for(int v=val[i]/1000;v<=V;v++){
dp[v]=max(dp[v],dp[v-val[i]/1000]+interest[i]);
}
}
for(int i=0;i<year;i++)
m+=dp[m/1000];
printf("%d\n",m);
}
return 0;
}
再上ac:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int maxn=11;
const int Maxn=50000;
int val[maxn],interest[maxn],dp[Maxn];
int main()
{
int T;
scanf("%d",&T);
while(T--){
int n,m,year;
scanf("%d%d",&m,&year);
int V=m*pow(1.1,(double)year)/1000;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&val[i],&interest[i]);
}
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
for(int v=val[i]/1000;v<=V;v++){
dp[v]=max(dp[v],dp[v-val[i]/1000]+interest[i]);
}
}
for(int i=0;i<year;i++)
m+=dp[m/1000];
printf("%d\n",m);
}
return 0;
}