Submission #134595

#	Time	Username	Problem	Language	Result	Execution time	Memory
134595		mirbek01	Holiday (IOI14_holiday)	C++11	7 / 100	5080 ms	2908 KiB

holiday

#include "holiday.h"
//#include "grader.cpp"
#include <bits/stdc++.h>

using namespace std;

long long int findMaxAttraction(int n, int start, int d, int ar[]) {
	long long ans = 0;
	for(int i = 0; i <= start; i ++){
		for(int j = start; j < n; j ++){
			int lenA = (start - i), lenB = (j - start);
			int cnt = d - lenA - lenB - min(lenA, lenB);
			vector <int> vec;
			for(int k = i; k <= j; k ++)
				vec.push_back(ar[k]);
			sort(vec.rbegin(), vec.rend());
			long long ret = 0;
			for(int k = 0; k < min( (int)vec.size(), cnt ); k ++)
				ret += vec[k];
			ans = max(ans, ret);
		}
	}
	
	return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53