#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define int long long
#define mod 1000000007
#define base 7001
#define base2 757
// #define pi acos(-1)
#define double long double
// #define ordered_set tree<pair<int, int>, null_type, less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
// #define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#pragma GCC optimize("O3,Ofast,unroll-loops")
#pragma GCC target("avx2,sse3,sse4,avx")
constexpr int maxn = 1000001;
const int N = 1 << (int)(ceil(log2(maxn)));
struct max_sub_sum
{
int mx, flag;
};
int n;
string s;
vector<int>v, idx[200];
void build(char a, char b)
{
int i = 0, j = 0;
while (i < idx[a].size() && j < idx[b].size())
{
if (idx[a][i] < idx[b][j])
{
v.push_back(1);
i++;
}
else
{
v.push_back(-1);
j++;
}
}
while (i < idx[a].size())
{
v.push_back(1);
i++;
}
while (j < idx[b].size())
{
v.push_back(-1);
j++;
}
return;
}
signed main()
{
cin.tie(0) -> sync_with_stdio(0);
cin >> n >> s;
for (int i = 0; i < s.size(); i++)
{
idx[s[i]].push_back(i);
}
int mx = 0;
for (char a = 'a'; a <= 'z'; a++)
{
if (!idx[a].size())
continue;
for (char b = 'a' ; b <= 'z'; b++)
{
if (a == b || !idx[b].size())
continue;
build(a, b);
max_sub_sum ans;
ans.mx = 0;
ans.flag = 0;
int sum = 0;
int sum2 = 0;
for (int i = 0; i < v.size(); i++)
{
sum2 += v[i];
if (v[i] + sum >= -1)
{
sum += v[i];
if (v[i] < 0)
ans.flag = 1;
if (ans.flag)
ans.mx = max(ans.mx, sum);
}
else
ans.flag = 0;
//cout << ans.mx << " ";
}
mx = max({ans.mx, mx, sum2});
v.clear();
}
}
cout << mx;
}
Compilation message
roz.cpp: In function 'void build(char, char)':
roz.cpp:35:20: warning: array subscript has type 'char' [-Wchar-subscripts]
35 | while (i < idx[a].size() && j < idx[b].size())
| ^
roz.cpp:35:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
35 | while (i < idx[a].size() && j < idx[b].size())
| ~~^~~~~~~~~~~~~~~
roz.cpp:35:41: warning: array subscript has type 'char' [-Wchar-subscripts]
35 | while (i < idx[a].size() && j < idx[b].size())
| ^
roz.cpp:35:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
35 | while (i < idx[a].size() && j < idx[b].size())
| ~~^~~~~~~~~~~~~~~
roz.cpp:37:17: warning: array subscript has type 'char' [-Wchar-subscripts]
37 | if (idx[a][i] < idx[b][j])
| ^
roz.cpp:37:29: warning: array subscript has type 'char' [-Wchar-subscripts]
37 | if (idx[a][i] < idx[b][j])
| ^
roz.cpp:48:20: warning: array subscript has type 'char' [-Wchar-subscripts]
48 | while (i < idx[a].size())
| ^
roz.cpp:48:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
48 | while (i < idx[a].size())
| ~~^~~~~~~~~~~~~~~
roz.cpp:53:20: warning: array subscript has type 'char' [-Wchar-subscripts]
53 | while (j < idx[b].size())
| ^
roz.cpp:53:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | while (j < idx[b].size())
| ~~^~~~~~~~~~~~~~~
roz.cpp: In function 'int main()':
roz.cpp:65:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
65 | for (int i = 0; i < s.size(); i++)
| ~~^~~~~~~~~~
roz.cpp:67:17: warning: array subscript has type 'char' [-Wchar-subscripts]
67 | idx[s[i]].push_back(i);
| ^
roz.cpp:72:18: warning: array subscript has type 'char' [-Wchar-subscripts]
72 | if (!idx[a].size())
| ^
roz.cpp:76:32: warning: array subscript has type 'char' [-Wchar-subscripts]
76 | if (a == b || !idx[b].size())
| ^
roz.cpp:84:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
84 | for (int i = 0; i < v.size(); i++)
| ~~^~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
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 |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
344 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
6 ms |
636 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
49 ms |
1440 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
478 ms |
14072 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
459 ms |
14072 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
489 ms |
13560 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
459 ms |
14068 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
