100tps,Subtask #1 TLE求调
查看原帖
100tps,Subtask #1 TLE求调
1320784
yinzixia楼主2024/12/6 20:40
#include<bits/stdc++.h>
using namespace std;

long long s,n,d;
long long dp[10000086];
long long v[15],w[15];//v价值,w空间
int main(){
	cin>>s>>n>>d;
	for(long long i=1;i<=d;i++)cin>>w[i]>>v[i];
	for(long long y=1;y<=n;y++){
		memset(dp, 0, sizeof(dp));
		for(long long i=1;i<=d;i++){
			for(long long j=w[i];j<=s;j++){
				dp[j]=max(dp[j],dp[j-w[i]]+v[i]);
			}
		}
		s+=dp[s];
	}
	cout<<s;
	return 0;
}
2024/12/6 20:40
加载中...