제출 #247702

#제출 시각아이디문제언어결과실행 시간메모리
247702MohamedAhmed04Hacker (BOI15_hac)C++14
0 / 100
0 ms384 KiB
#include <bits/stdc++.h> using namespace std ; const int MAX = 5e5 + 10 ; int arr[MAX] , pref[MAX] ; int n ; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cin>>n ; for(int i = 1 ; i <= n ; ++i) cin>>arr[i] ; int sum = 0 ; for(int i = 1 ; i <= n ; ++i) { pref[i] = pref[i-1] + arr[i] ; sum += arr[i] ; } priority_queue<int>q ; int a = (n+1) / 2 , b = n/2 ; for(int i = 1 ; i <= n ; ++i) { if(i+a-1 <= n) q.push(pref[i+a-1] - pref[i-1]) ; if(i+b-1 < n) q.push(sum - (pref[i+b-1] - pref[i-1])) ; } q.pop() ; return cout<<q.top()<<"\n" , 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...