제출 #1042906

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1042906		VMaksimoski008	Kas (COCI17_kas)	C++17	100 / 100	283 ms	392528 KiB

kas

#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

int dp[505][2*maxn+5];

signed main() {
    int n;
    cin >> n;

    ll sum = 0;
    vector<int> v(n+1);
    for(int i=1; i<=n; i++) cin >> v[i], sum += v[i];
    for(int j=0; j<=2*maxn; j++) dp[0][j] = -1e9;
    dp[0][maxn] = 0;

    for(int i=1; i<=n; i++) {
        for(int j=0; j<=2*maxn; j++) {
            dp[i][j] = dp[i-1][j];
            if(j + v[i] <= 2 * maxn && dp[i-1][j+v[i]] >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j+v[i]] + v[i]);
            if(j - v[i] >= 0 && dp[i-1][j-v[i]] >= 0) dp[i][j] = max(dp[i][j], dp[i-1][j-v[i]] + v[i]);
        }
    }

    cout << sum - dp[n][maxn] / 2 << '\n';
    return 0;
}

• 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