이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
int arr[500];int n;
int dp[500][200001];
int solve(int i,int sum){
if(i==n){
if(sum==100000)return 0;
else return -1e9;
}
if(dp[i][sum]!=-1)return dp[i][sum];
return dp[i][sum] = max({solve(i+1,sum),solve(i+1,sum-arr[i]),solve(i+1,sum+arr[i])+arr[i]});
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n;int sum = 0;
for(int i = 0;i<n;i++){cin>>arr[i];sum+=arr[i];}
memset(dp,-1,sizeof dp);
cout<<solve(0,100000)+((sum-(2*solve(0,100000))));
}
//
# | 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... |