This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for(int i=a; i>=b; --i)
#define rep(i, n) for(int i=0; i<n; ++i)
#define red(i, n) for(int i=n-1; i>=0; --i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define task "differ"
const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll LLinf = 1e18 + 27092008;
const int N = 1e6 + 5;
int n;
string s;
vector<int> pos[26];
int maxSub(vector<int> &arr){
int res = 0, Min1 = inf, Min2 = 0;
FOR(i,1,(int)arr.size()-1){
if (arr[i] == -1){
Min1 = min(Min1, Min2);
Min2 = inf;
}
arr[i] += arr[i-1];
res = max(res, arr[i] - Min1);
Min2 = min(Min2, arr[i]);
}
return res;
}
void solve(){
cin >> n >> s;
rep(i, n)
pos[s[i] - 'a'].pb(i);
int ans = 0;
rep(i, 26)
FOR(j,i+1,25){
vector<int> arr(1, 0), tmp;
int l=0, r=0;
while(l < pos[i].size() && r < pos[j].size())
if (pos[i][l] < pos[j][r]) arr.pb(+1), l++;
else arr.pb(-1), r++;
while(l < pos[i].size()) arr.pb(+1), l++;
while(r < pos[j].size()) arr.pb(-1), r++;
tmp = arr;
for(int &v : tmp) v = -v;
ans = max({ans, maxSub(arr), maxSub(tmp)});
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int tc = 1;
// cin >> tc;
while(tc--) solve();
return 0;
}
Compilation message (stderr)
roz.cpp: In function 'void solve()':
roz.cpp:50:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
50 | while(l < pos[i].size() && r < pos[j].size())
| ~~^~~~~~~~~~~~~~~
roz.cpp:50:42: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
50 | while(l < pos[i].size() && r < pos[j].size())
| ~~^~~~~~~~~~~~~~~
roz.cpp:53:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | while(l < pos[i].size()) arr.pb(+1), l++;
| ~~^~~~~~~~~~~~~~~
roz.cpp:54:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
54 | while(r < pos[j].size()) arr.pb(-1), r++;
| ~~^~~~~~~~~~~~~~~
roz.cpp: In function 'int main()':
roz.cpp:67:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
67 | freopen(task".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
roz.cpp:68:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
68 | freopen(task".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |