Submission #101863

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;++i)
#define pb(a) push_back(a)
#define mp(a,b) make_pair(a,b)
#define ALL(a) a.begin(),a.end()
#define SZ(a) (int)((a).size())
#define F first
#define S second
typedef pair<int,int> PI;
typedef long long ll;

ll sum[400000];
ll in[400000];

int main(int argc, char *argv[])
{
  int n,m;
  cin >> n >> m;
  rep(i,n){
    cin >> in[i];
    in[i+n]=in[i];
    in[i+2*n]=in[i];
  }

  rep(i,3*n) sum[i+1]=sum[i]+in[i];
  ll ans=sum[n/2]-sum[n/2-n/2];
  ll s=n/2;
  rep(i,m){
    ll k;
    cin >> k;
    s += k-1;
    s %= n;
    if(s<n/2) s+=n;
    ans=max(sum[s]-sum[s-n/2],ans);
  }
  cout << ans << endl;
}

Submission Info

Judge Result