Submission #101980

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

typedef long long lli;

const int N = 100000;

int n,m,w[N];
lli v[N],sum[N];

void solve(){
  sum[0] = 0;
  for(int i=0;i<n/2;i++) sum[0] += v[i];
  int L = 0, R = n/2;
  for(int i=1;i<n;i++){
    sum[i] = sum[i-1];
    sum[i] -= v[L];
    sum[i] += v[R];
    L = (L + 1) % n;
    R = (R + 1) % n;
  }

  int ansi = 0;
  lli ans = sum[0];
  for(int i=0;i<m;i++){
    ansi = (ansi + w[i]-1) % n;
    ans = max(ans, sum[ansi]);
  }
  cout << ans << endl;
    
}

int main(){
  while(cin >> n >> m){
    for(int i=0;i<n;i++) cin >> v[i];
    for(int i=0;i<m;i++) cin >> w[i];
    solve();
  }
}

Submission Info

Judge Result