제출 #298871

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
298871		shrek12357	Kas (COCI17_kas)	C++14	100 / 100	240 ms	196472 KiB

kas

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;

const int MAXV = 1e5+5;
#define MAXN 505

int main() {
	int dp[MAXN][MAXV];
	int best = 0;
	int n;
	cin >> n;
	vector<int> nums;
	int sum = 0;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < MAXV; j++) {
			dp[i][j] = INT_MIN;
		}
	}
	dp[0][0] = 0;
	for (int i = 0; i < n; i++) {
		int temp;
		cin >> temp;
		nums.push_back(temp);
		sum += temp;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < MAXV; j++) {
			dp[i][j] = max(dp[i - 1][j], max(dp[i - 1][j + nums[i - 1]], dp[i - 1][abs(j - nums[i - 1])]) + nums[i - 1]);
		}
		best = max(best, dp[i][0]);
	}
	cout << best/2 + sum-best << endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10