Submission #1321277

#TimeUsernameProblemLanguageResultExecution timeMemory
1321277vancongloc1234Bigger segments (IZhO19_segments)C++20
0 / 100
0 ms336 KiB
#include <bits/stdc++.h> #define Nmax 500009 #define int long long #define ed "\n" #define fast() ios_base::sync_with_stdio(false); cin.tie(nullptr); #define INF 100000000000000009 #define mod 1000000007 #define lim 1000009 using namespace std; int n; int a[Nmax]; signed main() { fast(); cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; int prev=a[1],ans=1,sum=0; for(int i=2;i<=n;i++) { if(sum>=prev) { sum=0; prev=sum; ans++; } sum+=a[i]; } if(sum>=prev)ans++; cout<<ans; return 0; } /* 5 8 7 2 4 3 7 9 1 9 1 2 3 4 5 7 7 8 9 9 7 -> 5 3 100 */
#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...