oj.uz

답안 #630364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630364 2022-08-16T09:26:47 Z kakayoshi Hacker (BOI15_hac) C++14
100 / 100
 79 ms 27212 KB 
#include <bits/stdc++.h>
using namespace std;
#define forw(i,a,b) for(int i=a;i<=b;i++)
#define forb(i,a,b) for(int i=a;i>=b;i--)
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define getbit(mask,i) ((mask>>i)&1)
#define getnum(i) (1<<(i))
#define maxi(a,b) (a)=max((a),(b))
typedef long long int ll;
const ll maxN=1e6+5;
const ll mod=1e9+7;
const ll oo=1e18;
ll n,len,sum,a[maxN],pre[maxN],ans[maxN],out;
void solve()
{
    cin>>n;
    len=n/2;
    forw(i,1,n)
    {
        cin>>a[i];
        a[i+n]=a[i];
        sum+=a[i];
    }
    forw(i,1,2*n)
        pre[i]=pre[i-1]+a[i];
    forw(i,1,2*n)
        ans[i]=pre[i+len-1]-pre[i-1];
    deque<int> p;
    for(int i=2;i+len-1<n+1;i++)
    {
        while (p.size() && ans[p.back()]<ans[i]) p.pop_back();
        p.push_back(i);
    }
    forw(i,1,n)
    {
        out=max(out,sum-ans[p.front()]);
        if (i+1==p.front()) p.pop_front();
        while (p.size() && ans[p.back()]<ans[n+i-len+1]) p.pop_back();
        p.push_back(n+i-len+1);
    }
    cout<<out;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    //freopen("bruh.inp","r",stdin);
    //freopen("bruh.out","w",stdout);
    solve();
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 2 ms 476 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 9 ms 4440 KB Output is correct
5 Correct 21 ms 10456 KB Output is correct
6 Correct 30 ms 13048 KB Output is correct
7 Correct 42 ms 15692 KB Output is correct
8 Correct 59 ms 25848 KB Output is correct

Subtask #4
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 2 ms 476 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 2 ms 724 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 596 KB Output is correct
31 Correct 1 ms 596 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 9 ms 4440 KB Output is correct
36 Correct 21 ms 10456 KB Output is correct
37 Correct 30 ms 13048 KB Output is correct
38 Correct 42 ms 15692 KB Output is correct
39 Correct 59 ms 25848 KB Output is correct
40 Correct 2 ms 852 KB Output is correct
41 Correct 3 ms 1348 KB Output is correct
42 Correct 5 ms 1884 KB Output is correct
43 Correct 35 ms 10488 KB Output is correct
44 Correct 60 ms 25968 KB Output is correct
45 Correct 12 ms 5368 KB Output is correct
46 Correct 43 ms 15672 KB Output is correct
47 Correct 79 ms 26012 KB Output is correct
48 Correct 68 ms 27212 KB Output is correct
49 Correct 45 ms 26316 KB Output is correct
50 Correct 46 ms 26352 KB Output is correct