oj.uz

Submission #891691

# Submission time Handle Problem Language Result Execution time Memory
891691 2023-12-23T16:46:29 Z ind1v Difference (POI11_roz) C++11
100 / 100
 614 ms 16156 KB 
#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 - 1; 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) {
        solve(i, j);
      }
    }
  }
  cout << ans << '\n';
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory 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
4 Correct 1 ms 4444 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory 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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 5068 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 5 ms 4444 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 612 ms 11612 KB Output is correct
2 Correct 1 ms 4440 KB Output is correct
3 Correct 364 ms 12212 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 11680 KB Output is correct
2 Correct 467 ms 10440 KB Output is correct
3 Correct 178 ms 12340 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 611 ms 11688 KB Output is correct
2 Correct 229 ms 14764 KB Output is correct
3 Correct 200 ms 14804 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 11544 KB Output is correct
2 Correct 214 ms 16156 KB Output is correct
3 Correct 211 ms 14992 KB Output is correct