hdoj 5933 ArcSoft‘s Office Rearrangement(贪心，模拟)

题目地址：点击打开链接

一开始读错题，以为可以合并任意两个区间。。其实是只能合并相邻的。

思路：分情况讨论，每次判断当前点是比avg大还是小，如果大的话就把多余的部分放到下一个点上，拆操作是商-1次。余数merge到下一个的操作是2次（一次拆，一次merge），如果小于平均的话就全merge到上一个去。 当然考虑当前和下一个的和能不能作为一次。

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 1e5+5;
typedef long long ll;
ll a[maxn], n, k;

int main(void)
{
    int t, ca = 1;
    cin >> t;
    while(t--)
    {
        scanf("%lld%lld", &n, &k);
        ll sum = 0;
        for(int i = 0; i < n; i++)
            scanf("%lld", &a[i]), sum += a[i];
        printf("Case #%d: ", ca++);
        if(sum%k) puts("-1");
        else
        {
            ll need = sum/k, ans = 0;
            for(int i = 0; i < n; i++)
            {
                if(a[i] < need)
                {
                    if(a[i]+a[i+1] <= need)
                        a[i+1] += a[i], ans++;
                    else
                        a[i+1] = a[i+1]+a[i]-need, ans += 2;
                }
                else if(a[i] > need)
                {
                    ll p = a[i]/need;
                    ll q = a[i]%need;
                    if(q)
                        a[i+1] += q, ans += 2;
                    ans += p-1;
                }
                else continue;
            }
            printf("%lld\n", ans);

        }
    }
    return 0;
}

ArcSoft's Office Rearrangement

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 708    Accepted Submission(s): 296

Problem 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.

 

Sample Input

  
  

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

 

Sample Output

  
  

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

 

Source

2016年中国大学生程序设计竞赛（杭州）

 

Recommend

liuyiding