补提篇--ICPC上海站--I

https://ac.nowcoder.com/acm/contest/24872/I

当时写了个记忆化搜索，没注意到n=100......

正解其实是dp。

#include<bits/stdc++.h>
#define LL long long
using namespace std;
const int N = 101;
const int M = 4105;
const LL INF = 1e15;
LL f[N][N][M];
int n,k;
LL v[N];
int sum[N];
int t[N];
int main(){

	scanf("%d%d",&n,&k);
	for(int i = 1;i <= n;++i)
		scanf("%lld%d",&v[i],&t[i]);
	for(int i = n;i >= 1;--i) sum[i] = sum[i + 1] + t[i];
	for(int j = 0;j <= k;++j){
		for(int h = 0;h <= sum[1] * 2;++h) f[0][j][h] = -INF;
	}	
	f[0][0][0] = 0;
	for(int i = 1;i <= n;++i){
		for(int j = 0;j <= k;++j){
			for(int h = 0;h <= sum[1] * 2;++h){
				f[i][j][h] = f[i - 1][j][h];
				
				f[i][j][h] = max(f[i][j][h],
				max(f[i - 1][j][h + t[i]],
				f[i - 1][j][abs(h - t[i])]) + v[i]);
				if(j != 0) f[i][j][h] = max(f[i][j][h],
				max(f[i - 1][j - 1][h + 2 * t[i]],            //增大两倍放到T。
				f[i - 1][j - 1][abs(h - 2 * t[i])]) + v[i]); //增大两倍放到S
			}    
		}
	}
	LL ans = 0;
	for(int i = 0;i <= k;++i) ans = max(ans,f[n][i][0]);
	cout << ans ; 
	return 0;
}

题解讲的很清楚了。