Submission #887099

#	Time	Username	Problem	Language	Result	Execution time	Memory
887099		Hovhannes1234	Bigger segments (IZhO19_segments)	C++17	0 / 100	0 ms	604 KiB

segments

#include <bits/stdc++.h>
using namespace std;

const int N = 3000;
int a[N], pref[N];

int main() {
	int n, sum=0;
	cin>>n;
	for(int i=1; i<=n; i++){
		cin>>a[i];
		sum+=a[i];
	}
	pref[1]=a[1];
	for(int i=2; i<=n; i++){
		pref[i]=pref[i-1]+a[i];
	}
	int ans=1, s=0, k=0;
	vector <int> vec;
	for(int j=1; j<=n; j++){
		s=pref[j];
		ans=1;
		k=0;
		for(int i=j+1; i<=n; i++){
			k+=a[i];
			if(k >= s){
				ans++;
				s=k;
				k=0;
			}
		}
		vec.push_back(ans);
	}
	sort(vec.begin(), vec.end());
	cout<<vec[(int)vec.size()-1];
}

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