제출 #882056

#제출 시각아이디문제언어결과실행 시간메모리
88205612345678Hacker (BOI15_hac)C++17
0 / 100
1 ms456 KiB
#include <bits/stdc++.h> using namespace std; const int nx=5e5+5; int n, qs[nx], res; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) cin>>qs[i], qs[i]+=qs[i-1]; for (int i=1; i<=n; i++) res=max(res, min(qs[i], qs[n]-qs[i-1])); cout<<res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...