C. Coin Rows

// Problem: A. Di-visible Confusion
// Contest: Codeforces - Codeforces Round #752 (Div. 1)
// URL: https://codeforces.com/problemset/problem/1603/A
// Memory Limit: 256 MB
// Time Limit: 1000 ms
// 2022-02-18 14:58:38
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define pii pair<int, int>
#define mset(s,t) memset(s,t,sizeof(t))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define fir first
#define pb push_back
#define sec second
#define sortall(x) sort((x).begin(),(x).end())
inline int read () {
	int x = 0, f = 0;
	char ch = getchar();
	while (!isdigit(ch)) f |= (ch=='-'),ch= getchar();
	while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
	return f?-x:x;
}
template<typename T> void print(T x) {
	if (x < 0) putchar('-'), x = -x;
	if (x >= 10) print(x/10);
	putchar(x % 10 + '0');
}

const int N = 1e5 + 10;
int a[3][N];
int n, m;
void solve() {
	cin >> m;
	for (int i = 1; i<= 2; i ++)
		for (int j = 1; j<= m; j++)
		{
			cin >> a[i][j];
			a[i][j] += a[i][j - 1];
		}
	// for (int i = 1; i<= 2; i++) {
		// for (int j =1; j<= m; j++)
			// cout << a[i][j] << " ";
		// puts("");
	// }
	int ans = 0x3f3f3f3f;
		for (int j = 1; j<= m; j ++) {
			int t = max (0, a[1][m] - a[1][j]);
			t = max (t, a[2][j - 1]);
			if (t < ans) {
				ans = t;
			}
		}
		print(ans);
		puts("");
	
}
int main () {
    int t;
	cin >> t;
    while (t --) solve();
    return 0;
}

通过模拟发现，如果走走下去了再也上不来了。所以答案却决于在哪里下去。观察范围，可以每一列，然后取最优值。 注意bob的选择在alice的前提下。