Submission #83595

#	Time	Username	Problem	Language	Result	Execution time	Memory
83595		luciocf	Nizin (COCI16_nizin)	C++14	0 / 100	202 ms	4388 KiB

nizin

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e6+10;

int num[maxn];

int main(void)
{
	int n;
	cin >> n;

	for (int i = 1; i <= n; i++)
		cin >> num[i];

	int l = 1, r = n, ans = 0;
	ll somal = num[1], somar = num[n];

	while (true)
	{
		if (l > r) break;

		if (somal < somar) somal += (ll)num[++l], ans++;
		else if (somar < somal) somar += (ll)num[--r], ans++;
		else somal = num[++l], somar = num[--r];
	}

	cout << ans << "\n";
}

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