제출 #1096819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096819		Muhammet	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	600 KiB

segments

#include <bits/stdc++.h>

using namespace std;

int main(){
	int n;
	cin >> n;
	vector <int> a(n+1);
	for(int i = 1; i <= n; i++){
		cin >> a[i];
	}
	long long s2 = 0, ans1 = 0;
	for(int j = 1; j <= n; j++){
		s2 += a[j];
		long long l = j, s = s2, s1 = 0, ans = 1;
		for(int i = j+1; i <= n; i++){
			s1 += a[i];
			if(s1 >= s){
				ans++;
				for(; l < i-1; l++){
					if(s+a[l+1] > s1-a[l+1]) break;
					s += a[l+1];
					s1 -= a[l+1];
				}
				s = s1;
				l = i;
				s1 = 0;
			}
		}
		ans1 = max(ans,ans1);
	}
	cout << ans1;
}

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