746

# 题目

## Description

ArcSoft, Inc. is a leading global professional computer photography and computer vision technology company.

There are N working blocks in ArcSoft company, which form a straight line. The CEO of ArcSoft thinks that every block should have equal number of employees, so he wants to re-arrange the current blocks into K new blocks by the following two operations:

• merge two neighbor blocks into a new block, and the new block's size is the sum of two old blocks'.
• split one block into two new blocks, and you can assign the size of each block, but the sum should be equal to the old block.

Now the CEO wants to know the minimum operations to re-arrange current blocks into K block with equal size, please help him.

## Input

First line contains an integer T, which indicates the number of test cases.

Every test case begins with one line which two integers N and K, which is the number of old blocks and new blocks.

The second line contains N numbers a1, a2, , aN, indicating the size of current blocks.

Limits
1≤T≤100
1≤N≤105
1≤K≤105
1≤ai≤105

## Output

For every test case, you should output 'Case #x: y', where x indicates the case number and counts from 1 and y is the minimum operations.

If the CEO can't re-arrange K new blocks with equal size, y equals -1.

3
1 3
14
3 1
2 3 4
3 6
1 2 3

Case #1: -1
Case #2: 2
Case #3: 3

# 题解

1. 对于 相邻 的方块,可以将他们融合成一个
2. 对于一个方块,可以将它拆成任意大小的两个

int 存不下！！！

# 代码

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <iomanip>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cmath>
#include <set>
#include <vector>
#include <list>
#include <map>
#include <functional>

using namespace std;

const int maxn = 100005;

int kase = 1;
long long a[maxn];

int main() {
cin.tie(0);
cin.sync_with_stdio(false);

int T;
cin >> T;
while(T--) {
int n,m;
cin >> n >> m;

long long sum = 0;
for(int i = 0;i<n;i++) {
cin >> a[i];
sum += a[i];
}

cout << "Case #" << kase++ << ": ";
if(sum%m) {
cout << "-1";
} else {
long long t = sum / m;
long long ans = 0;
for(int i = 0;i<n;i++) {
while(a[i]>t) {
a[i] -= t;
ans++;
}
if(a[i]<t) {
a[i + 1] += a[i];
ans++;
}
}
cout << ans;
}
cout << endl;
}
return 0;
}

• 点击查看/关闭被识别为广告的评论