#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n;
int f[N], g[N];
vector<int> idx[26];
int ans = 0;
int b[N];
int ptr;
void solve(int mn, int mx) {
ptr = 1;
int i = 0, j = 0;
while (i < (int) idx[mn].size() && j < (int) idx[mx].size()) {
if (idx[mn][i] < idx[mx][j]) {
b[ptr] = -1;
ptr++;
i++;
} else if (idx[mx][j] < idx[mn][i]) {
b[ptr] = 1;
ptr++;
j++;
}
}
while (i < (int) idx[mn].size()) {
b[ptr] = -1;
ptr++;
i++;
}
while (j < (int) idx[mx].size()) {
b[ptr] = 1;
ptr++;
j++;
}
int sum = 0;
for (int i = 1; i <= ptr; i++) {
sum = max(b[i], b[i] + sum);
f[i] = sum;
}
sum = 0;
for (int i = ptr; i >= 1; i--) {
sum = max(b[i], b[i] + sum);
g[i] = sum;
}
for (int i = 1; i <= ptr; i++) {
if (b[i] == -1) {
ans = max(ans, f[i] + g[i] + 1);
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 1; i <= n; i++) {
char d;
cin >> d;
idx[d - 'a'].push_back(i);
}
for (int i = 0; i < 26; i++) {
for (int j = 0; j < 26; j++) {
if (i != j && !idx[i].empty() && !idx[j].empty()) {
solve(i, j);
}
}
}
cout << ans << '\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
4440 KB |
Output is correct |
2 |
Correct |
1 ms |
4440 KB |
Output is correct |
3 |
Correct |
1 ms |
4444 KB |
Output is correct |
4 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
4440 KB |
Output is correct |
2 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
2396 KB |
Output is correct |
2 |
Incorrect |
1 ms |
4444 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
4444 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
4444 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
65 ms |
5068 KB |
Output is correct |
2 |
Correct |
1 ms |
4440 KB |
Output is correct |
3 |
Correct |
5 ms |
4444 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
613 ms |
11636 KB |
Output is correct |
2 |
Correct |
1 ms |
4444 KB |
Output is correct |
3 |
Correct |
308 ms |
12380 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
613 ms |
11680 KB |
Output is correct |
2 |
Correct |
455 ms |
10444 KB |
Output is correct |
3 |
Correct |
98 ms |
13192 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
620 ms |
11820 KB |
Output is correct |
2 |
Correct |
65 ms |
14844 KB |
Output is correct |
3 |
Correct |
78 ms |
15868 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
612 ms |
11360 KB |
Output is correct |
2 |
Correct |
39 ms |
16168 KB |
Output is correct |
3 |
Correct |
119 ms |
15972 KB |
Output is correct |