oj.uz

답안 #926139

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
926139 2024-02-12T15:26:36 Z Ludissey Hacker (BOI15_hac) C++14
0 / 100
 0 ms 348 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n; cin >> n;
    vector<int> v(n*2+1);
    vector<int> mx(n*2+1);
    int tot=0;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        tot+=v[i];
    }
    for (int i = 0; i <= n; i++) v[i+n]=v[i];
    
    int sum=0;
    for (int i = 0; i <= (n-1)/2; i++) sum+=v[i];
    mx[0]=sum;
    for (int i = 1; i < n; i++)
    {
        sum-=v[i];
        sum+=v[((n-1)/2)+i];
        mx[i]=sum;
    }
    for (int i = 0; i <= n; i++) mx[i+n]=mx[i];
    deque<int> queue;
    for (int i = 1; i <= (n+1/2); i++)
    {
        while(!queue.empty()&&mx[queue.back()]>mx[i]) queue.pop_back();
        queue.push_back(i);
    }
    int outp=mx[queue.front()];
    for (int i = n; i < n*2; i++)
    {
        if(!queue.empty()&&queue.front()==(i-n)+1) queue.pop_front();
        while(!queue.empty()&&mx[queue.back()]>mx[i]) queue.pop_back();
        queue.push_back(i);
        outp=max(mx[queue.front()], outp);
    }
    cout << outp << "\n";
    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -