Submission #328494

#	Time	Username	Problem	Language	Result	Execution time	Memory
328494		ryansee	Bigger segments (IZhO19_segments)	C++14	37 / 100	80 ms	117484 KiB

segments

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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());    //can be used by calling rng() or shuffle(A, A+n, rng)
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusivesss
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long; 
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (3006)
ll dp[MAXN][MAXN], n, A[MAXN], ans, mx[MAXN][MAXN];
int main() {
	FAST
	cin>>n;
	FOR(i,1,n) cin>>A[i];
	FOR(i,1,n) A[i] += A[i-1];
	for(auto&i:mx)for(auto&j:i)j=-INF;
	FOR(i,1,n) {
		FOR(j,1,i) {
			mx[i][j] = max(mx[i][j],mx[i-1][j]);
			dp[i][j] = max((ll)(j == 1 ? 1 : -INF), mx[i][j-1]+1);
			ans=max(ans,dp[i][j]);
		}
		DEC(j,i,1){
			if(dp[i][j]<=0) continue;
			ll more = lower_bound(A+1,A+n+1,2*A[i]-A[j-1]) - A;
			mx[more][i]=max(mx[more][i], dp[i][j]);
			break;
		}
	}
	cout<<ans<<'\n';
}

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