Submission #707763

#	Time	Username	Problem	Language	Result	Execution time	Memory
707763		penguin133	Bigger segments (IZhO19_segments)	C++17	13 / 100	10 ms	4340 KiB

segments

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

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, A[500005], P[500005], dp[3005][3005];


void solve(){
	cin >> n;
	for(int i=1;i<=n;i++)cin >> A[i], P[i] = P[i-1] + A[i];
	for(int i=1;i<=n;i++)for(int j=0;j<=n;j++)dp[i][j] = 1e18;
	dp[0][0] = 0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=i;j++){
			if(j == 1)dp[i][j] = P[i];
			else{
				int hi = i - 1, lo = 1, ans = hi + 1;
				while(lo <= hi){
					int mid = (lo + hi) >> 1;
					if(dp[mid][j-1] < 1e18)ans = mid, hi = mid - 1;
					else lo = mid + 1;
				}
				if(ans == i)continue;
				lo = ans, hi = i - 1, ans = lo - 1;
				while(lo <= hi){
					int mid = (lo + hi) >> 1;
					if(dp[mid][j-1] <= P[i] - P[mid])dp[i][j] = min(dp[i][j], P[i] - P[mid]), lo = mid + 1;
					else hi = mid - 1;
				}
			}
		}
		//cout << '\n';
	}
	for(int i=n;i>=1;i--)if(dp[n][i] < 1e18){cout << i; return ;}
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message (stderr)

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

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