oj.uz

Submission #926151

# Submission time Handle Problem Language Result Execution time Memory
926151 2024-02-12T15:44:01 Z Ludissey Hacker (BOI15_hac) C++14
100 / 100
 42 ms 11356 KB 
#include <bits/stdc++.h>
using namespace std;

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
	int n; cin >> n;
    vector<int> v(n*2+(n/2)+1,0);
    vector<int> mx(n*2+(n/2)+1,0);
    int tot=0;
    for (int i = 0; i < n*2; i++) {
        if(i<n) {
            cin >> v[i];
            v[i+n]=v[i];
        }
        v[i]+=v[i-1];
    }
    int half=((n+1)/2);
    for (int i = 0; i < n*2; i++){
        mx[i]=v[i+half-1]-v[i-1];
    }
    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;
}

Compilation message

hac.cpp: In function 'int main()':
hac.cpp:9:9: warning: unused variable 'tot' [-Wunused-variable]
    9 |     int tot=0;
      |         ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 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 348 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 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 348 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 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 7 ms 2044 KB Output is correct
5 Correct 16 ms 4188 KB Output is correct
6 Correct 22 ms 5368 KB Output is correct
7 Correct 27 ms 6236 KB Output is correct
8 Correct 41 ms 10232 KB Output is correct

Subtask #4
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 344 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 348 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 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 7 ms 2044 KB Output is correct
36 Correct 16 ms 4188 KB Output is correct
37 Correct 22 ms 5368 KB Output is correct
38 Correct 27 ms 6236 KB Output is correct
39 Correct 41 ms 10232 KB Output is correct
40 Correct 1 ms 600 KB Output is correct
41 Correct 2 ms 616 KB Output is correct
42 Correct 4 ms 860 KB Output is correct
43 Correct 17 ms 4188 KB Output is correct
44 Correct 42 ms 10072 KB Output is correct
45 Correct 9 ms 2436 KB Output is correct
46 Correct 26 ms 6340 KB Output is correct
47 Correct 41 ms 10076 KB Output is correct
48 Correct 34 ms 11100 KB Output is correct
49 Correct 32 ms 11100 KB Output is correct
50 Correct 34 ms 11356 KB Output is correct