杭电acm2124 Repair the Wall

cwhong723

于 2017-12-18 17:32:03 发布

阅读量247

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.youkuaiyun.com/cwhong_723/article/details/78835265

解决一道算法题目，关于如何使用最少数量的木块修复长度为L的城墙裂缝。通过贪心算法，对木块按长度从大到小排序后逐一尝试使用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Repair the Wall

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 5217 Accepted Submission(s): 2506

Problem Description

Long time ago , Kitty lived in a small village. The air was fresh and the scenery was very beautiful. The only thing that troubled her is the typhoon.

When the typhoon came, everything is terrible. It kept blowing and raining for a long time. And what made the situation worse was that all of Kitty's walls were made of wood.

One day, Kitty found that there was a crack in the wall. The shape of the crack is
a rectangle with the size of 1×L (in inch). Luckly Kitty got N blocks and a saw(锯子) from her neighbors.
The shape of the blocks were rectangle too, and the width of all blocks were 1 inch. So, with the help of saw, Kitty could cut down some of the blocks(of course she could use it directly without cutting) and put them in the crack, and the wall may be repaired perfectly, without any gap.

Now, Kitty knew the size of each blocks, and wanted to use as fewer as possible of the blocks to repair the wall, could you help her ?

Input

The problem contains many test cases, please process to the end of file( EOF ).
Each test case contains two lines.
In the first line, there are two integers L(0<L<1000000000) and N(0<=N<600) which
mentioned above.
In the second line, there are N positive integers. The i^th integer Ai(0<Ai<1000000000 ) means that the i^th block has the size of 1×Ai (in inch).

Output

For each test case , print an integer which represents the minimal number of blocks are needed.
If Kitty could not repair the wall, just print "impossible" instead.

Sample Input

Sample Output

2
impossible

贪心问题，一块木板尽量多用几次，最后用的总木块数尽量少，所以先将裂缝安小到大排序

/**
 * date:2017.11.16
 * author:孟小德
 * function:杭电acm2124
 *  Repair the Wall     贪心算法，先最木块进行排序，最大最长的先处理
 */



import java.util.*;

public class acm2124
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);

        while (input.hasNextInt())
        {
            int L = input.nextInt();
            int N = input.nextInt();

            // 输入木块长度
            int[] wood = new int[N];
            for (int i=0;i<N;i++)
            {
                wood[i] = input.nextInt();
            }

            sort(wood);

            int len = 0;
            int num = 0;
            for (int i=0;i<N;i++)
            {
                if ((len + wood[i]) < L)
                {
                    len += wood[i];
                    num++;
                }
                else
                {
                    len += wood[i];
                    num++;
                    break;
                }

            }

            if (len >= L)
            {
                System.out.println(num);
            }
            else
            {
                System.out.println("impossible");
            }
        }
    }

    // 木块长度由大到小排列
    public static void sort(int[] wood)
    {
        boolean flag = true;
        int temp;
        for (int i = 0;i<wood.length && flag;i++)
        {
            flag = false;
            for (int j = 0;j<wood.length-i-1;j++)
            {
                if (wood[j] < wood[j+1])
                {
                    temp = wood[j];
                    wood[j] = wood[j+1];
                    wood[j+1] = temp;
                    flag = true;
                }

            }
        }
    }
}