提交时间:2023-12-02 09:58:08
运行 ID: 113352
#include<bits/stdc++.h> #define ll long long using namespace std; const ll N=1e6+9; ll n,w[N],dp[N]; int main() { cin>>n;ll sum=0; for(int i=1;i<=n;i++) cin>>w[i],sum+=w[i]; for(int i=1;i<=n;i++) for(int j=w[i];j<=sum/2;j++) dp[j]=max(dp[j-w[i]]+w[i],dp[j]); if(dp[sum/2]==sum/2 && sum%2==0) cout<<"true"; else cout<<"false"; return 0; }