제출 #1019826

#제출 시각아이디문제언어결과실행 시간메모리
1019826ZeroCoolKas (COCI17_kas)C++14
100 / 100
159 ms3588 KiB
#include <bits/stdc++.h>
using namespace std;
  
#define int long long
  
#define ll long long
#define ar array
#define ld long double
  
const int N = 5e5 + 20;
const int MOD = 1e9 + 7;
const int K = 700;
const int INF = 1e17;
const int LOG = 34;
const int X = 100005;


int dp[2][2 * X];

signed main(){ios::sync_with_stdio(false);cin.tie(0);   
	memset(dp[0], -1, sizeof dp[0]);
	int n;
	cin>>n;
	dp[0][X] = 0;
	int k = 0;
	int sum = 0;
	while(n--){
		
		int x;
		cin>>x;
		sum += x;
		for(int i = 0;i < 2 * X;i++)dp[k ^ 1][i] = dp[k][i];
		for(int i = 0;i < 2 * X;i++){
			if(dp[k][i] == -1)continue;
			if(i - x >= 0)dp[k ^ 1][i-x] = max(dp[k ^ 1][i-x], dp[k][i] + x);
			if(i + x < 2 * X)dp[k ^ 1][i+x] = max(dp[k ^ 1][i+x], dp[k][i] + x);
		}
		k ^= 1;
	}
	cout<<sum - dp[k][X] / 2;
}

// Te molam da raboti!
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...