제출 #88919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
88919		heon	Kas (COCI17_kas)	C++11	40 / 100	570 ms	198368 KiB

kas

#include<bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
typedef vector <int> vi;
typedef pair<int,int> ii;
typedef long long ll;

const int MOD = 1e9 + 7;

vi v;
int dp[100005][505];
int sum;

int f(int n, int ind, int diff, int prvi, int drugi){
	if(ind == n && prvi != drugi) return 0;
	if(ind == n && prvi == drugi) return prvi;
	if(dp[diff][ind] != -1) return dp[diff][ind];
	return dp[diff][ind] = max({f(n, ind + 1, diff + v[ind], prvi + v[ind], drugi), f(n, ind + 1, abs(diff - v[ind]), prvi, drugi + v[ind]),
							f(n, ind + 1, diff, prvi, drugi)});
}


int main(){

    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    v.resize(n);
    memset(dp, -1, sizeof(dp));
    for(int i = 0; i < n; i++){
    	cin >> v[i];
    }
    sum = accumulate(all(v), 0);
    int ret = f(n, 0, 0, 0, 0);
    cout << ret + (sum - 2 * ret);
}

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