답안 #885542

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885542 2023-12-10T03:06:48 Z votranngocvy Difference (POI11_roz) C++17
60 / 100
1000 ms 13268 KB
#include <bits/stdc++.h>
using namespace std;
 
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
const int N = 1e6 + 5;
char a[N];
vector<int>pos[30];
int n,val[N],maxPreSum[N],maxSufSum[N];
 
int calc(int a,int b) {
    if (pos[a].size() == 0 || pos[b].size() == 0) return 0;
    vector<pii>vec;
    for (auto x: pos[a]) vec.push_back(mp(x,1));
    for (auto x: pos[b]) vec.push_back(mp(x,-1));
    int m = vec.size();
    sort(vec.begin(),vec.end());
    maxPreSum[0] = maxSufSum[m + 1] = 0;
    int sum = 0;
    for (int i = 1; i <= m; i++) {
        sum = max(sum + vec[i - 1].se,vec[i - 1].se);
        maxPreSum[i] = sum;
    }
    sum = 0;
    for (int i = m; i > 0; i--) {
        sum = max(sum + vec[i - 1].se,vec[i - 1].se);
        maxSufSum[i] = sum;
    }
    int ans = 0;
    for (int i = 1; i <= m; i++) {
        if (vec[i - 1].se == 1) continue;
        int tmp = maxPreSum[i - 1] + maxSufSum[i + 1] - 1;
        tmp = max(tmp,maxPreSum[i - 1] - 1);
        tmp = max(tmp,maxSufSum[i - 1] - 1);
        ans = max(ans,tmp);
    }
    return ans;
}
 
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= n; i++) pos[a[i] - 'a'].push_back(i);
    int ans = 0;
    for (int i = 0; i < 26; i++)
        for (int j = 0; j < 26; j++) 
            if (i != j) ans = max(ans,calc(i,j));
    cout << ans << "\n";
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 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 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 293 ms 5184 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 20 ms 4696 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1035 ms 13036 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1043 ms 13268 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1036 ms 13256 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1037 ms 13052 KB Time limit exceeded
2 Halted 0 ms 0 KB -