提出 #48378667

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n, m;
    std::string s;
    is >> n >> m >> s;
    s += '0';

    Num answer {0};
    Num meal {0};
    Num comp {0};
    for(Num i{0}; i<=n; ++i) {
        const char c = s.at(i);
        if (c == '0') {
            const auto ct = std::max(0LL, meal - m) + comp;
            answer = std::max(answer, ct);
            meal = 0;
            comp = 0;
        } else if (c == '1') {
            meal += 1;
        } else if (c == '2') {
            comp += 1;
        }
    }

    os << answer << "\n";
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

提出情報

ジャッジ結果