Submission #19675436

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD int(1e9+7)
#define INF int(1e9+7)
#define LINF ll(1e18+7)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define P pair<ll,ll>
#define chmax(x,y) (x = max(x,y))
#define chmin(x,y) (x = min(x,y))

int a,b;
int l[1100];
int r[1100];
int dp1[1100][1100];
int dp2[1100][1100];

int main(){
  cin>>a>>b;
  rep(i,a) cin>>l[i];
  rep(i,b) cin>>r[i];
  dp1[a][b]=0;
  dp2[a][b]=0;
  for(int i=a; i>=0; i--)for(int j=b; j>=0; j--){
    if((i+j)%2==(a+b)%2){
      if(i-1>=0) chmax(dp1[i-1][j],dp1[i][j]+l[a-i]);
      if(j-1>=0) chmax(dp1[i][j-1],dp1[i][j]+r[b-j]);
      if(i-1>=0) dp2[i-1][j]=dp2[i][j];
      if(j-1>=0) dp2[i][j-1]=dp2[i][j];
    }else{
      if(i-1>=0) chmax(dp2[i-1][j],dp2[i][j]+l[a-i]);
      if(j-1>=0) chmax(dp2[i][j-1],dp2[i][j]+r[b-j]);
      if(i-1>=0) dp1[i-1][j]=dp1[i][j];
      if(j-1>=0) dp1[i][j-1]=dp1[i][j];
    }
  }
  cout<<dp1[0][0]<<endl;
}

Submission Info

Judge Result