提出 #32720438

---

ソースコード 拡げる

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define Per(i, sta, n) for (int i = n - 1; i >= sta; i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[8] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[8] = {0, 0, 1, -1, 1, -1, 1, -1};
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;

template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}

template <class T>
bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}

int n;
string s;
int w[200010], S[200010], T[200010];

void solve() {
  cin >> n;
  cin >> s;
  rep(i, n) cin >> w[i];
  map<int, int> v, ma;
  rep(i, n) {
    v[w[i]] += s[i] - '0';
    ma[w[i]]++;
  }
  int siz = v.size();
  int i = 0;
  for (auto x : v) {
    S[i + 1] = S[i] + x.second;
    i++;
  }
  int j = 0;
  for (auto x : ma) {
    T[j + 1] = T[j] + x.second;
    j++;
  }
  int ans = 0;
  rep(i, siz + 1) {
    // cout << S[i] << " " << T[i] << endl;
    chmax(ans, T[i] - 2 * S[i] + S[siz]);
  }
  cout << ans << endl;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(50);
  solve();
}

提出情報

ジャッジ結果