Submission #1237063

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237063		PlayVoltz	Bigger segments (IZhO19_segments)	C++20	100 / 100	83 ms	12104 KiB

segments

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	vector<int> psum(n+1, 0);
	for (int i=1; i<=n; ++i)cin>>psum[i], psum[i]+=psum[i-1];
	vector<pii> dp(n+1, mp(-1, -1));
	dp[0]=mp(1, 0);
	for (int i=1; i<=n; ++i){
		dp[i]=max(dp[i], dp[i-1]);
		auto it = lower_bound(psum.begin(), psum.end(), 2*psum[i]-psum[dp[i].se]);
		if (it!=psum.end())dp[it-psum.begin()]=max(dp[it-psum.begin()], mp(dp[i].fi+1, i));
	}
	cout<<dp[n].fi;
}

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