Submission #102996

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

#define FOR(i, a, n) for(int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, n) for(int i = (n) - 1; i >= (a); i--)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
#define fst first
#define snd second

typedef long long ll;

const int MAX_N = 110000;

int n, m;
ll a[MAX_N];
ll s[MAX_N];

int main(){
  cin >> n >> m;
  REP(i, n){
	cin >> a[i];
	s[i + 1] = s[i] + a[i];
  }
  ll p = 0, r = s[n / 2];
  REP(i, m){
	int k;
	cin >> k;
	k--;
	p = (p + k) % n;
	ll v = 0;
	if(p + n / 2 > n){
	  v = s[n] - s[p];
	  v += s[n / 2 - (n - p)];
	}else{
	  v = s[p + n / 2] - s[p];
	}
	r = max(r, v);
  }
  cout << r << endl;
}

Submission Info

Judge Result