This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn=1e5+10;
const int mod=1e9+7;
int n;
ll a[503];
ll dp[maxn], sum=0; ///dp[i] is the max sum of the subsequences that when split optimally, the 2 parts differ by i
ll curr[maxn];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
for(int i=0; i<maxn; i++){
dp[i]=-INT_MAX;
}
dp[0]=0;
cin>>n;
for(int i=0; i<n; i++){
cin>>a[i];
for(int j=0; j<=sum+a[i]; j++){
curr[j]=dp[j];
}
for(int j=0; j<=sum+a[i]; j++){
if(dp[j]==-INT_MAX) continue;
curr[j+a[i]]=max(curr[j+a[i]], dp[j]+a[i]);
if(j>=a[i]){
curr[j-a[i]]=max(curr[j-a[i]], dp[j]);
}else{
curr[a[i]-j]=max(curr[a[i]-j], dp[j]+a[i]-j);
}
}
sum+=a[i];
for(int j=0; j<=sum; j++){
dp[j]=max(curr[j], dp[j]);
}
}
cout<<sum-dp[0]<<endl;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |