oj.uz

답안 #126646

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
126646 2019-07-08T08:31:53 Z miguel Hacker (BOI15_hac) C++14
0 / 100
 2 ms 376 KB 
#include<bits/stdc++.h>
using namespace std;
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair <int, int>
#define pii pair <int, pi>
#define vi vector <int>
const ll mod = 1e9 + 7;
int n, a[500001], s[1000001];

int32_t main(){
    ios_base :: sync_with_stdio(0); cin.tie(); cout.tie();
    cin>>n;
    for(int i=0; i<n; i++){
        cin>>a[i];
        if(i) s[i]=s[i-1]+a[i];
        else s[i]=a[i];
    }
    for(int i=n; i<=2*n; i++) s[i]=s[i-1]+a[i%n];
    int ans=0;
    for(int i=0; i<n; i++){
        int cur=0;
        for(int j=i+1; j+n/2<i+n; j++) cur=max(cur, s[j+n/2]-s[j]);
        ans=max(ans, s[n-1]-cur);
    }
    cout<<ans;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 40.0

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