Poj 3782 Equal Sum Partitions

Poj 3782 Equal Sum Partitions

Question:

For a sequence, divide it into several sub-sequences that are equal to each other to obtain the possible minimum sum.

Analysis:

The brute force enumeration is good, and the data is weak.

Code:

// Poj 3782 // sep9 # include <iostream> using namespace std; const int maxN = 10024; int a [maxN], n; int test (int mid) {int I, sum = 0; for (I = 1; I <= n; ++ I) {sum + = a [I]; if (sum = mid) sum = 0; else if (sum <mid) continue; elsereturn 0;} if (sum! = 0) return 0; return 1;} int main () {int cases, cases_num, ans; scanf ("% d", & cases); while (cases --) {int I, sum = 0; scanf ("% d", & cases_num, & n); for (I = 1; I <= n; ++ I) {scanf ("% d", & a [I]); sum + = a [I] ;}for (I = 0; I <= sum; ++ I) if (test (I) = 1) {ans = I; break;} printf ("% d \ n", cases_num, ans);} return 0 ;}