제출 #1290850

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1290850		MinhKien	Kas (COCI17_kas)	C++20	100 / 100	67 ms	1220 KiB

kas

#include <iostream>

using namespace std;

const int N = 510;
const int M = 1e5 + 10;

int n, a[N], sum;
int dp[2][M];

int main() {
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);

    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        sum += a[i];
    }

    fill_n(dp[0] + 1, sum, 1e9);
    for (int i = 1; i <= n; ++i) {
        int b = i & 1;
        for (int j = 0; j <= sum; ++j) {
            int Min = dp[b ^ 1][j] + a[i];
            if (j + a[i] <= sum) Min = min(dp[b ^ 1][j + a[i]], Min);
            Min = min(dp[b ^ 1][abs(j - a[i])], Min);
            dp[b][j] = Min;
        }
    }

    int ans = sum - dp[n & 1][0];
    cout << ans / 2 + dp[n & 1][0] << "\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