【枚举】上课睡觉——Acwing4366

#include <iostream>

using namespace std;

const int N = 100010;

int n;
int w[N];

bool check(int cnt)
{
    int sum = 0;
    for (int i = 0; i < n; i ++ ) 
    {
        sum += w[i];
        if (sum > cnt) return false;
        if (sum == cnt) sum = 0;
    }
    
    return true;
}

int main()
{
    int t;
    cin >> t;
    while (t -- )
    {
        scanf("%d", &n);
        int s = 0;
        for (int i = 0; i < n; i ++ ) 
        {
           cin >> w[i];
           s += w[i];
        }
        
        for (int i = n; i; i -- ) //堆数越多，操作数量越少
            if (s % i == 0 && check(s / i))
            {
                printf("%d\n", n - i);//原来的堆数减去操作后的堆数
                break;                //就是操作数
            }
    }
    
    return 0;
}