Submission #499696

#	Time	Username	Problem	Language	Result	Execution time	Memory
499696		sireanu_vlad	Bigger segments (IZhO19_segments)	C++14	37 / 100	1557 ms	2332 KiB

segments

#include <iostream>
using namespace std;

int n, v[500001], seg[500001], k[500001];
unsigned long long sum[500001];

void read()
{
	cin >> n;
	for(int i = 1; i <= n; ++i)
	{
		cin >> v[i];
		sum[i] = sum[i-1] + v[i];
	}
}

int main()
{
	read();
	for(int i = 1; i <= n; ++i)
		for(int j = 0; j < i; ++j)
			if(sum[i] - sum[j] >= sum[j] - sum[seg[j]])
				if(k[i] <= k[j] + 1)
				{
					k[i] = k[j] + 1;
					seg[i] = j;
				}
	cout << k[n];
	return 0;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27