第一道题:分割队列 AC
#include <iostream>
#include <cmath>
using namespace std;
const int N = 1e5 + 7;
int a[N], s[N];
int n, sum, mn = 1e9;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", a + i);
s[i] = s[i-1] + a[i];
sum += a[i];
}
for (int i =