#include "sequence.h"
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second
vector<int> ct[500005];
int N;
struct segTree {
pii seg[4*500005];
int lazy[4*500005];
void laze(int i, int l, int r) {
seg[i] = {seg[i].f+lazy[i], seg[i].s+lazy[i]};
if(l!=r) {
lazy[i*2+1] += lazy[i];
lazy[i*2+2] += lazy[i];
}
lazy[i] = 0;
}
void build(int i, int l, int r, int val) {
lazy[i] = 0;
if(l==r) {
seg[i].f = seg[i].s = val*l;
return;
}
int m = (l+r)/2;
build(i*2+1, l, m, val);
build(i*2+2, m+1, r, val);
seg[i].f = min(seg[i*2+1].f, seg[i*2+2].f);
seg[i].s = max(seg[i*2+1].s, seg[i*2+2].s);
}
void build(int val) {
build(0, 0, N, val);
}
void update(int i, int l, int r, int wl, int wr, int val) {
if(wl<=l && wr>=r) lazy[i] += val;
laze(i, l, r);
if(wl>r || wr<l || (wl<=l && wr>=r)) return;
int m = (l+r)/2;
update(i*2+1, l, m, wl, wr, val);
update(i*2+2, m+1, r, wl, wr, val);
seg[i].f = min(seg[i*2+1].f, seg[i*2+2].f);
seg[i].s = max(seg[i*2+1].s, seg[i*2+2].s);
}
void update(int wl, int wr, int val) {
update(0, 0, N, wl, wr, val);
}
pii query(int i, int l, int r, int wl, int wr) {
laze(i, l, r);
if(wl>r || wr<l) return {(int)1e9, (int)-1e9};
if(wl<=l && wr>=r) return seg[i];
int m = (l+r)/2;
pii q1 = query(i*2+1, l, m, wl, wr);
pii q2 = query(i*2+2, m+1, r, wl, wr);
return {min(q1.f, q2.f), max(q1.s, q2.s)};
}
pii query(int wl, int wr) {
return query(0, 0, N, wl, wr);
}
} les, mor;
int sequence(int n, std::vector<int> A) {
N = n;
for(int i=0;i<N;i++) {
ct[A[i]].push_back(i+1);
}
les.build(1);
mor.build(1);
int ans = 1;
for(int i=1;i<=N;i++) {
for(int j:ct[i]) {
les.update(j, N, -2);
}
for(int j=0;j+ans<ct[i].size();j++) {
while(j+ans<ct[i].size()) {
int st = ct[i][j];
int en = ct[i][j+ans];
int qles = les.query(en, N).f - les.query(0, st-1).s;
int qmor = mor.query(en, N).s - les.query(0, st-1).f;
if(qles<=0 && qmor>=0) ans++;
else break;
}
}
for(int j:ct[i]) {
mor.update(j, N, -2);
}
}
return ans;
}
Compilation message
sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:80:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
80 | for(int j=0;j+ans<ct[i].size();j++) {
| ~~~~~^~~~~~~~~~~~~
sequence.cpp:81:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
81 | while(j+ans<ct[i].size()) {
| ~~~~~^~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
46828 KB |
Output is correct |
2 |
Correct |
8 ms |
46704 KB |
Output is correct |
3 |
Correct |
8 ms |
46836 KB |
Output is correct |
4 |
Correct |
8 ms |
46604 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
8 ms |
46684 KB |
Output is correct |
7 |
Correct |
8 ms |
46684 KB |
Output is correct |
8 |
Correct |
8 ms |
46680 KB |
Output is correct |
9 |
Correct |
8 ms |
46684 KB |
Output is correct |
10 |
Correct |
8 ms |
46684 KB |
Output is correct |
11 |
Correct |
9 ms |
46632 KB |
Output is correct |
12 |
Correct |
9 ms |
46684 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
46828 KB |
Output is correct |
2 |
Correct |
8 ms |
46704 KB |
Output is correct |
3 |
Correct |
8 ms |
46836 KB |
Output is correct |
4 |
Correct |
8 ms |
46604 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
8 ms |
46684 KB |
Output is correct |
7 |
Correct |
8 ms |
46684 KB |
Output is correct |
8 |
Correct |
8 ms |
46680 KB |
Output is correct |
9 |
Correct |
8 ms |
46684 KB |
Output is correct |
10 |
Correct |
8 ms |
46684 KB |
Output is correct |
11 |
Correct |
9 ms |
46632 KB |
Output is correct |
12 |
Correct |
9 ms |
46684 KB |
Output is correct |
13 |
Correct |
11 ms |
48732 KB |
Output is correct |
14 |
Correct |
10 ms |
48876 KB |
Output is correct |
15 |
Correct |
9 ms |
48732 KB |
Output is correct |
16 |
Correct |
10 ms |
48728 KB |
Output is correct |
17 |
Correct |
11 ms |
48732 KB |
Output is correct |
18 |
Correct |
8 ms |
48732 KB |
Output is correct |
19 |
Correct |
10 ms |
48732 KB |
Output is correct |
20 |
Correct |
9 ms |
48728 KB |
Output is correct |
21 |
Incorrect |
9 ms |
48732 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
46828 KB |
Output is correct |
2 |
Correct |
304 ms |
68880 KB |
Output is correct |
3 |
Correct |
327 ms |
68868 KB |
Output is correct |
4 |
Correct |
381 ms |
61040 KB |
Output is correct |
5 |
Correct |
351 ms |
67932 KB |
Output is correct |
6 |
Correct |
306 ms |
67920 KB |
Output is correct |
7 |
Correct |
289 ms |
61420 KB |
Output is correct |
8 |
Correct |
341 ms |
61564 KB |
Output is correct |
9 |
Correct |
402 ms |
61060 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
46704 KB |
Output is correct |
2 |
Correct |
468 ms |
61176 KB |
Output is correct |
3 |
Correct |
505 ms |
61056 KB |
Output is correct |
4 |
Correct |
530 ms |
61048 KB |
Output is correct |
5 |
Correct |
622 ms |
61180 KB |
Output is correct |
6 |
Incorrect |
547 ms |
61128 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
451 ms |
74600 KB |
Output is correct |
2 |
Correct |
462 ms |
74584 KB |
Output is correct |
3 |
Correct |
460 ms |
73812 KB |
Output is correct |
4 |
Correct |
513 ms |
74024 KB |
Output is correct |
5 |
Correct |
465 ms |
70692 KB |
Output is correct |
6 |
Correct |
437 ms |
70688 KB |
Output is correct |
7 |
Correct |
403 ms |
69488 KB |
Output is correct |
8 |
Correct |
380 ms |
69176 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
46828 KB |
Output is correct |
2 |
Correct |
8 ms |
46704 KB |
Output is correct |
3 |
Correct |
8 ms |
46836 KB |
Output is correct |
4 |
Correct |
8 ms |
46604 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
8 ms |
46684 KB |
Output is correct |
7 |
Correct |
8 ms |
46684 KB |
Output is correct |
8 |
Correct |
8 ms |
46680 KB |
Output is correct |
9 |
Correct |
8 ms |
46684 KB |
Output is correct |
10 |
Correct |
8 ms |
46684 KB |
Output is correct |
11 |
Correct |
9 ms |
46632 KB |
Output is correct |
12 |
Correct |
9 ms |
46684 KB |
Output is correct |
13 |
Correct |
11 ms |
48732 KB |
Output is correct |
14 |
Correct |
10 ms |
48876 KB |
Output is correct |
15 |
Correct |
9 ms |
48732 KB |
Output is correct |
16 |
Correct |
10 ms |
48728 KB |
Output is correct |
17 |
Correct |
11 ms |
48732 KB |
Output is correct |
18 |
Correct |
8 ms |
48732 KB |
Output is correct |
19 |
Correct |
10 ms |
48732 KB |
Output is correct |
20 |
Correct |
9 ms |
48728 KB |
Output is correct |
21 |
Incorrect |
9 ms |
48732 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
46828 KB |
Output is correct |
2 |
Correct |
8 ms |
46704 KB |
Output is correct |
3 |
Correct |
8 ms |
46836 KB |
Output is correct |
4 |
Correct |
8 ms |
46604 KB |
Output is correct |
5 |
Correct |
8 ms |
46684 KB |
Output is correct |
6 |
Correct |
8 ms |
46684 KB |
Output is correct |
7 |
Correct |
8 ms |
46684 KB |
Output is correct |
8 |
Correct |
8 ms |
46680 KB |
Output is correct |
9 |
Correct |
8 ms |
46684 KB |
Output is correct |
10 |
Correct |
8 ms |
46684 KB |
Output is correct |
11 |
Correct |
9 ms |
46632 KB |
Output is correct |
12 |
Correct |
9 ms |
46684 KB |
Output is correct |
13 |
Correct |
11 ms |
48732 KB |
Output is correct |
14 |
Correct |
10 ms |
48876 KB |
Output is correct |
15 |
Correct |
9 ms |
48732 KB |
Output is correct |
16 |
Correct |
10 ms |
48728 KB |
Output is correct |
17 |
Correct |
11 ms |
48732 KB |
Output is correct |
18 |
Correct |
8 ms |
48732 KB |
Output is correct |
19 |
Correct |
10 ms |
48732 KB |
Output is correct |
20 |
Correct |
9 ms |
48728 KB |
Output is correct |
21 |
Incorrect |
9 ms |
48732 KB |
Output isn't correct |
22 |
Halted |
0 ms |
0 KB |
- |