oj.uz

Submission #49159

# Submission time Handle Problem Language Result Execution time Memory
49159 2018-05-22T22:07:48 Z faishol27 Hacker (BOI15_hac) C++14
0 / 100
 2 ms 544 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define PUB push_back

int N, dapat;
ll  data[500005],
    sliding = 0,
    ans = 0;
vector <ll> score;

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> N;
    dapat = (N+1)/2;

    for(int i=0;i<N;i++){
        cin >> data[i];
    }

    for(int i=0;i<dapat;i++) sliding += data[i];
    score.PUB(sliding); 
    
    for(int i=1;i<N;i++){
        int right = (dapat+i-1)%N;
        sliding = sliding-data[i-1]+data[right];
        
        score.PUB(sliding);
    }

    sort(score.begin(), score.end());
    for(ll elm:score){
        if(elm != score.back()) ans = max(ans, elm);
    }

    cout << ans << endl;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

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

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Halted 0 ms 0 KB -