Submission #101924

---

Source Code Expand

#include <iostream>
#include <vector>

typedef long long ll;

using namespace std;

int main(){
    ll N,M;
    cin >> N >> M;
    vector<ll> A(2*N);
    for(int i=0;i<N;i++) cin >> A[i];
    for(int i=0;i<N;i++) A[i+N] = A[i];

    vector<ll> s(2*N,0);
    for(int i=1;i<2*N;i++){
        s[i] = s[i-1] + A[i-1];
    }

    vector<ll> t(N);
    for(int i=0;i<N;i++) {
        t[i] = s[i+N/2] - s[i];
    }

    ll now = 0;
    ll maxi = t[0];
    for(int i=0;i<M;i++){
        ll k;
        cin >> k;
        now = (now + k - 1 + N) % N;

        maxi = max(maxi,t[now]);
    }
    cout << maxi << endl;
    return 0;
}

Submission Info

Judge Result