oj.uz

답안 #824343

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824343 2023-08-14T03:31:41 Z irmuun Hacker (BOI15_hac) C++17
0 / 100
 1 ms 320 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin>>n;
    ll v[n+1],sum[2*n+1];
    sum[0]=0;
    for(ll i=1;i<=n;i++){
        cin>>v[i];
        sum[i]=sum[i-1]+v[i];
    }
    for(ll i=n+1;i<=2*n;i++){
        sum[i]=sum[i-1]+v[i-n];
    }
    auto tot=[&](ll l,ll r) ->ll{
        return sum[r]-sum[l-1];
    };
    multiset<ll,greater<ll>>s;
    ll up=(n+1)/2;
    ll ans=0;
    for(ll i=1;i<=up;i++){
        s.insert(tot(i,i+up-1));
    }
    for(ll i=up+1;i<=up+n;i++){
        s.erase(s.find(tot(i-up,i-1)));
        s.insert(tot(i,i+up-1));
        ans=max(ans,*s.begin());
    }
    cout<<ans;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 40.0

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