2021-10-08

A - Coin Rows CodeForces - 1555C
Alice and Bob are playing a game on a matrix, consisting of 2 rows and m columns. The cell in the i-th row in the j-th column contains ai,j coins in it.

Initially, both Alice and Bob are standing in a cell (1,1). They are going to perform a sequence of moves to reach a cell (2,m).

The possible moves are:

Move right — from some cell (x,y) to (x,y+1);
Move down — from some cell (x,y) to (x+1,y).
First, Alice makes all her moves until she reaches (2,m). She collects the coins in all cells she visit (including the starting cell).

When Alice finishes, Bob starts his journey. He also performs the moves to reach (2,m) and collects the coins in all cells that he visited, but Alice didn’t.

The score of the game is the total number of coins Bob collects.

Alice wants to minimize the score. Bob wants to maximize the score. What will the score of the game be if both players play optimally?

Input
The first line contains a single integer t (1≤t≤104) — the number of testcases.

Then the descriptions of t testcases follow.

The first line of the testcase contains a single integer m (1≤m≤105) — the number of columns of the matrix.

The i-th of the next 2 lines contain m integers ai,1,ai,2,…,ai,m (1≤ai,j≤104) — the number of coins in the cell in the i-th row in the j-th column of the matrix.

The sum of m over all testcases doesn’t exceed 105.

Output
For each testcase print a single integer — the score of the game if both players play optimally.

思路：用c数组来装a数组中前i项和 用d数组来装c数组中前i项和
让bob发挥最佳 即 bob从 d[i-1]和c[m]-c[i]两条路中选择吃金币最多的那一条路
让alice发挥最佳 即 alice从共有m列向下中哪一个i列向下bob吃金币最少
输出最后bob吃金币数

     注意:
     是c[i]=c[i-1]+a[i];d[i]=d[i-1]+b[i];
     而不是c[i]+=a[i];d[i]+=b[i];  
     INT_MAX是int类型中最大的数
     定义int w=INF_MAX  在for循环中w的值改变了  不会再变回INT_MAX

AC代码：

#include<bits/stdc++.h>
int t,m;
int a[100005],b[100005],c[100005],d[100005];
using namespace std;
int main()
{
scanf("%d",&t);
while(t–)
{
d[0]=c[0]=0;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&a[i]);
c[i]=c[i-1]+a[i];
}
for(int i=1;i<=m;i++)
{
scanf("%d",&b[i]);
d[i]=d[i-1]+b[i];
}
int w=INT_MAX;
for(int i=1;i<=m;i++)
{
int q=max(d[i-1],c[m]-c[i]);
w=min(q,w);
}
printf("%d\n",w);
}

return 0;
}