제출 #1173261

#제출 시각아이디문제언어결과실행 시간메모리
1173261ezzzayBigger segments (IZhO19_segments)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back #define int long long const int N=5e5; int a[N]; signed main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } int mx=0; for(int i=1;i<=n;i++){ int s=0,cnt=1; int ps=0; for(int j=1;j<=n;j++){ if(j<=i){ s+=a[j]; ps=s; continue; } if(i==j-1){ s=0; } s+=a[j]; if(s>=ps){ ps=s; s=0; cnt++; } } mx=max(mx,cnt); } cout<<mx; }
#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...