제출 #409115

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
409115		8e7	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	212 KiB

segments

//Challenge: Accepted
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <stack>
#include <set>
#define ll long long
#define maxn 1005
#define maxq 100005
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
signed main() {
	io
	int n;
	cin >> n;
	ll prv = 0, cur = 0;
	int ans = 0;
	for (int i = 0;i < n;i++)  {
		ll x;
		cin >> x;
		cur += x;
		if (cur >= prv) {
			prv = cur;
			ans++;
			cur = 0;
		}
	}
	cout << ans << endl;
}
/*
2
1 3
1
1 2 2

5
1 2 3 4 5
0

*/

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