Submission #342513

#	Time	Username	Problem	Language	Result	Execution time	Memory
342513		NurstanDuisengaliev	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	364 KiB

segments

// Nurstan Duisengaliev
// не, не надо меня узнавать 
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("O3")*/                   
      
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp> 
 
#define ll long long
#define all(x) x.begin(), x.end()
#define in insert
#define mp make_pair
#define F first
#define S second
#define ppf pop_front
#define pb push_back
#define ppb pop_back
#define pf push_front
#define pii pair <int, int>
#define pll pair <ll, ll>
#define boost() ios_base::sync_with_stdio(0), cin.tie(0)
#define sz(x) (int)x.size()
 
using namespace std;
//using namespace __gnu_pbds;
 
//template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;                         
 
const int N = (int)2e5 + 123;
const int mod = (int)1e9 + 7;
const ll INF = (ll)1e18 + 1;
int n;
ll a[N], pref[N]; 
void solve () {
	cin >> n;
	for (int i = 1; i <= n; i ++) {
		cin >> a[i];
		pref[i] = pref[i - 1] + a[i];
	}
	int maxi = 1;		
	for (int i = 1; i <= n; i ++) {
		int lasti = i;
		ll last = pref[i];
		int pos = i + 1, sum = 1;
		while (pos <= n) {
			if (pref[pos] - pref[lasti] >= last) {
				sum ++;
				last = pref[pos] - pref[lasti];
				lasti = pos;		
			}
			pos ++;
		}
		maxi = max (maxi, sum);				
	}
	cout << maxi;
}   	
 
main () {
//	freopen (".in", "r", stdin);
//	freopen (".out", "w", stdout);
	boost ();
	int TT = 1;
//    cin >> TT;
	while (TT --) {
		solve ();
	}
	return 0;	                                    
}                                                   

Compilation message (stderr)

segments.cpp:62:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   62 | main () {
      |       ^

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