oj.uz

Submission #926147

# Submission time Handle Problem Language Result Execution time Memory
926147 2024-02-12T15:39:25 Z Ludissey Hacker (BOI15_hac) C++14
100 / 100
 50 ms 36176 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n; cin >> n;
    vector<int> v(n*4+1,0);
    vector<int> mx(n*4+1,0);
    int tot=0;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        tot+=v[i];
    }
    for (int i = 0; i <= n; i++) v[i+n]=v[i];
    for (int i = 0; i < n*2; i++) v[i]+=v[i-1];
    
    int sum=0;
    for (int i = 0; i <= (n-1)/2; i++) sum+=v[i];
    mx[0]=sum;
    int half=((n+1)/2);
    for (int i = 0; i < n*2; i++){
        mx[i]=v[i+half-1]-v[i-1];
    }
    for (int i = 0; i <= n; i++) mx[i+n]=mx[i];
    deque<int> queue;
    for (int i = 0; i < half; i++)
    {
        while(!queue.empty()&&mx[queue.back()]>mx[i]) queue.pop_back();
        queue.push_back(i);
    }
    int outp=mx[queue.front()];
    for (int i = half; i < (n*2); i++)
    {
        if(!queue.empty()&&queue.front()==i-half) queue.pop_front();
        while(!queue.empty()&&mx[queue.back()]>mx[i]) queue.pop_back();
        queue.push_back(i);
        outp=max(mx[queue.front()], outp);
    }
    cout << outp << "\n";
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 9 ms 5468 KB Output is correct
5 Correct 19 ms 13752 KB Output is correct
6 Correct 25 ms 17228 KB Output is correct
7 Correct 32 ms 20632 KB Output is correct
8 Correct 50 ms 33940 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 500 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 9 ms 5468 KB Output is correct
36 Correct 19 ms 13752 KB Output is correct
37 Correct 25 ms 17228 KB Output is correct
38 Correct 32 ms 20632 KB Output is correct
39 Correct 50 ms 33940 KB Output is correct
40 Correct 2 ms 1120 KB Output is correct
41 Correct 2 ms 1624 KB Output is correct
42 Correct 4 ms 2392 KB Output is correct
43 Correct 20 ms 13660 KB Output is correct
44 Correct 48 ms 33880 KB Output is correct
45 Correct 10 ms 7000 KB Output is correct
46 Correct 30 ms 20316 KB Output is correct
47 Correct 49 ms 33820 KB Output is correct
48 Correct 42 ms 36176 KB Output is correct
49 Correct 40 ms 35408 KB Output is correct
50 Correct 37 ms 35416 KB Output is correct