这种题也能算省选。。AC代码:
#include<iostream>
#include<cstdio>
using namespace std;
int n,m,a[105]; bool dp[105][2005];
int main(){
int i,x; scanf("%d%d%d",&n,&x,&m); dp[0][x]=1;
for (i=1; i<=n; i++) scanf("%d",&a[i]);
for (i=1; i<=n; i++)
for (x=0; x<=m; x++){
if (x>=a[i]) dp[i][x]=dp[i-1][x-a[i]];
if (x+a[i]<=m) dp[i][x]|=dp[i-1][x+a[i]];
}
for (i=m; i>=0; i--) if (dp[n][i]) break; printf("%d\n",i);
return 0;
}
by lych
2015.12.19