oj.uz

Submission #475045

# Submission time Handle Problem Language Result Execution time Memory
475045 2021-09-20T19:40:53 Z MohammadAghil Hacker (BOI15_hac) C++14
20 / 100
 70 ms 10316 KB 
#include <bits/stdc++.h> 
using namespace std;
typedef long long ll;
typedef pair<int, int> pp;
#define rep(i,l,r) for(int i = (l); i < (r); (i)++)
#define per(i,r,l) for(int i = (r); i >= (l); (i)--)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define ss second 
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll mod = 1e9 + 7, maxn = 2e5 + 5, inf = 1e18 + 5;

int main(){
    cin.tie(0) -> sync_with_stdio(0);
    int n; cin >> n;
    vector<ll> v(n), s(n);
    ll su = 0;
    rep(i,0,n){
        cin >> v[i];
        su += v[i];
    }
    int t = n/2;
    ll sum = 0;
    rep(i,0,t){
        sum += v[i];
    }
    s[0] = sum;
    rep(i,1,n){
        sum += v[(i + t - 1)%n];
        sum -= v[i - 1];
        s[i] = sum;
    }
    ll ans = inf;
    deque<int> q;
    rep(i,1,n){
        if(i + t - 1 >= n) break;
        while(sz(q) && s[q.back()] < s[i]) q.pop_back();
        q.pb(i);
    }
    ans = min(ans, s[q.front()]);
    rep(i,1,n){
        if(q.front() == i) q.pop_front();
        while(sz(q) && s[q.back()] < s[(i + t)%n]) q.pop_back();
        q.pb((i + t)%n);
        ans = min(ans, s[q.front()]);
    }
    cout << su - ans;
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 11 ms 1868 KB Output is correct
5 Correct 30 ms 4228 KB Output is correct
6 Correct 35 ms 5248 KB Output is correct
7 Correct 41 ms 6396 KB Output is correct
8 Correct 70 ms 10316 KB Output is correct

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 1 ms 308 KB Output isn't correct
4 Halted 0 ms 0 KB -