oj.uz

답안 #31422

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
31422 2017-08-22T14:55:38 Z imaxblue Hacker (BOI15_hac) C++14
20 / 100
 643 ms 25484 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()

int n, ans=(1 << 30)+(1 << 29), c;
ll psa[1500005];
multiset<int> s;
int main(){
    scanf("%i", &n);
    fox1(l, n){
        scanf("%i", &psa[l]);
        psa[l+n]=psa[l];
        c+=psa[l];
    }
    fox1(l, n*3){
        psa[l]+=psa[l-1];
    }
    for(int l=n/2; l<=n*2; ++l){
        s.insert(psa[l]-psa[l-n/2]);
        if (s.size()>(n+1)/2) s.erase(s.lb(psa[l-(n+1)/2]-psa[l-n]));
        ans=min(ans, *--s.end());
    }
    cout << c-ans;
    return 0;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:33:28: warning: format '%i' expects argument of type 'int*', but argument 2 has type 'long long int*' [-Wformat=]
         scanf("%i", &psa[l]);
                            ^
hac.cpp:42:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (s.size()>(n+1)/2) s.erase(s.lb(psa[l-(n+1)/2]-psa[l-n]));
                     ^
hac.cpp:31:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i", &n);
                    ^
hac.cpp:33:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i", &psa[l]);
                             ^

Subtask #1
0 / 20.0

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

Subtask #2
0 / 20.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 13736 KB Output is correct
2 Correct 0 ms 13736 KB Output is correct
3 Correct 3 ms 13868 KB Output is correct
4 Correct 69 ms 15584 KB Output is correct
5 Correct 173 ms 18488 KB Output is correct
6 Correct 313 ms 19676 KB Output is correct
7 Correct 323 ms 20732 KB Output is correct
8 Correct 643 ms 25484 KB Output is correct

Subtask #4
0 / 40.0

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