Submission #979327

#TimeUsernameProblemLanguageResultExecution timeMemory
979327LucaIlieHacker (BOI15_hac)C++17
0 / 100
1 ms348 KiB
#include <bits/stdc++.h> using namespace std; const int MAX_N = 5e5; long long sp[MAX_N + 1]; int main() { int n; cin >> n; for ( int i = 1; i <= n; i++ ) { int x; cin >> x; sp[i] = sp[i - 1] + x; } long long maxx = 0; for ( int i = 1; i <= n; i++ ) maxx = max( maxx, min( sp[i], sp[n] - sp[i - 1] ) ); cout << maxx; 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...