Submission #482843

#	Time	Username	Problem	Language	Result	Execution time	Memory
482843		levsog2004	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	204 KiB

segments

#include <iostream>
#include <iomanip>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <cmath>
#include <list>
#include <set>
#include <map>
using namespace std;
#define all(a) a.begin(), a.end()
typedef long long ll;
const ll N = 2000004;
const ll mod = 1000 * 1000 * 1000 + 7;
const ll inf = 1000000000;
ll n, m, k, z, t, x, y, ans,a[N];
int main()
{
	cin >> n;
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i];
	}
	x = a[0];
	ans = 1;
	for (int i = 1; i < n;)
	{
		ans++;
		int j = i;
		y = 0;
		while (i<n && y < x)
		{
			y += a[i];
			++i;
		}
		if (i >= n)
		{
			break;
		}
		while (x + a[j] < y - a[j])
		{
			y -= a[j];
			x += a[j];
			j++;
		}
	}
	cout << ans << endl;
	return 0;
}

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