Submission #1321400

#TimeUsernameProblemLanguageResultExecution timeMemory
1321400maomaoBigger segments (IZhO19_segments)C++20
13 / 100
1595 ms4152 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define rep(i,s,n) for(int i=s;i<=n;i++) #define vi vector<int> #define pb push_back #define pii pair<int,int> #define eb emplace_back #define fi first #define se second #define tup pair<int, pii> vi a((int)5e5+5); int ans,n; void f(int last, int cur,int i, int cnt) { cur+=a[i]; if(cur>=last) { if(i+1<=n) f(cur,0,i+1,cnt+1); else ans=max(ans, cnt+1); } if(i+1<=n)f(last,cur,i+1LL,cnt); } signed main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin>>n; ans=1; rep(i,1,n) { cin>>a[i]; } f(0,0,1,0); cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...