题解 | 牛牛与切割机

#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main() {
    int n;
    long long num;
    cin >> n;
    vector<long long>a(n);
    for (int i = 0; i < n; i++) {
        cin >> num;
        if (i == 0)
            a[i] = num;
        else
            a[i] = a[i - 1] + num;
    }
    long long min_s=a[0]*(a[n-1]-a[0]);
    for(int i=1;i<n-1;i++)
    {
        long long min1=a[i]*(a[n-1]-a[i]);
        min_s=min(min1,min_s);
    }
    cout<<min_s;
}
// 64 位输出请用 printf("%lld")