为什不判v[i]+j<=c就要WA？
1 #include<algorithm> 2 #include<iostream> 3 #include<cstdlib> 4 #include<cstring> 5 #include<cstdio> 6 #include<string> 7 #include<cmath> 8 #include<ctime> 9 #include<queue> 10 #include<stack> 11 #include<map> 12 #include<set> 13 #define rre(i,r,l) for(int i=(r);i>=(l);i--) 14 #define re(i,l,r) for(int i=(l);i<=(r);i++) 15 #define Clear(a,b) memset(a,b,sizeof(a)) 16 #define inout(x) printf("%d",(x)) 17 #define douin(x) scanf("%lf",&x) 18 #define strin(x) scanf("%s",(x)) 19 #define LLin(x) scanf("%lld",&x) 20 #define op operator 21 #define CSC main 22 typedef unsigned long long ULL; 23 typedef const int cint; 24 typedef long long LL; 25 using namespace std; 26 void inin(int &ret) 27 { 28 ret=0;int f=0;char ch=getchar(); 29 while(ch<'0'||ch>'9'){if(ch=='-')f=1;ch=getchar();} 30 while(ch>='0'&&ch<='9')ret*=10,ret+=ch-'0',ch=getchar(); 31 ret=f?-ret:ret; 32 } 33 int n,c,v[55],hh[55][1010],qi; 34 int main() 35 { 36 inin(n),inin(qi),inin(c); 37 re(i,1,n)inin(v[i]); 38 hh[0][qi]=1; 39 re(i,1,n)re(j,0,c) 40 { 41 if(j>=v[i])hh[i][j]|=hh[i-1][j-v[i]]; 42 if(j+v[i]<=c)hh[i][j]|=hh[i-1][j+v[i]]; 43 } 44 rre(i,c,0)if(hh[n][i]) 45 { 46 cout<<i; 47 return 0; 48 } 49 cout<<-1; 50 return 0; 51 }