提出 #45963542

---

ソースコード 拡げる

#include <bits/stdc++.h>

void solve(std::istream& is, std::ostream& os) {
    using Num = long long int;

    Num n {0};
    Num m {0};
    is >> n >> m;

    std::vector<Num> added(n);
    for (Num i{1}; i<n; ++i) {
        Num s {0};
        is >> s;
        added.at(i) = s - added.at(i-1);
    }

    std::vector<Num> xs(m);
    for(auto&& x : xs) {
        is >> x;
    }

    std::map<Num, Num> candidates;
    for (Num i{0}; i<n; ++i) {
        for (Num j{0}; j<m; ++j) {
            const Num sign = (i & 1) ? 1 : -1;
            const Num d = sign * (xs.at(j) - added.at(i));
            candidates[d] += 1;
        }
    }

    Num answer {0};
    for(const auto& v : candidates) {
        answer = std::max(answer, v.second);
    }

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

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

提出情報

ジャッジ結果