Fence Repair

最新推荐文章于 2022-04-10 20:19:40 发布

Slatter

最新推荐文章于 2022-04-10 20:19:40 发布

阅读量179

点赞数

分类专栏：算法文章标签： OJ

本文链接：https://blog.csdn.net/Slatter/article/details/94626747

版权

算法专栏收录该内容

89 篇文章 1 订阅

订阅专栏

Fence Repair

Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into the N planks (i.e., whose length is the sum of the lengths Li). FJ is ignoring the “kerf”, the extra length lost to sawdust when a sawcut is made; you should ignore it, too.

FJ sadly realizes that he doesn’t own a saw with which to cut the wood, so he mosies over to Farmer Don’s Farm with this long board and politely asks if he may borrow a saw.

Farmer Don, a closet capitalist, doesn’t lend FJ a saw but instead offers to charge Farmer John for each of the N-1 cuts in the plank. The charge to cut a piece of wood is exactly equal to its length. Cutting a plank of length 21 costs 21 cents.

Farmer Don then lets Farmer John decide the order and locations to cut the plank. Help Farmer John determine the minimum amount of money he can spend to create the N planks. FJ knows that he can cut the board in various different orders which will result in different charges since the resulting intermediate planks are of different lengths.

Input

Line 1: One integer N, the number of planks
Lines 2…N+1: Each line contains a single integer describing the length of a needed plank

Output

Line 1: One integer: the minimum amount of money he must spend to make N-1 cuts

Sample Input

Sample Output

Hint

He wants to cut a board of length 21 into pieces of lengths 8, 5, and 8.
The original board measures 8+5+8=21. The first cut will cost 21, and should be used to cut the board into pieces measuring 13 and 8. The second cut will cost 13, and should be used to cut the 13 into 8 and 5. This would cost 21+13=34. If the 21 was cut into 16 and 5 instead, the second cut would cost 16 for a total of 37 (which is more than 34).

C++编写：

#include<iostream>
using namespace std;
typedef long long ll;
const int  MAX_N=20000;
int N,L[MAX_N+10];        //N表示所需木板块数，数组用于记录每块木板的长度

void min_money()
{
    for(int i=0;i<N;i++)
        cin>>L[i];
    ll min=0;
    while(N>1)
    {
        int min1=0,min2=1;
        if(L[min1]>L[min2])   swap(min1,min2);
        for(int i=2;i<N;i++)
        {
            if(L[i]<L[min1])
            {
                min2=min1;
                min1=i;
            }
            else if(L[i]<L[min2])
                min2=i;
        }

        int min_sum = L[min1]+L[min2];
        min += min_sum;

        if(min2 == N-1)      swap(min1,min2);
        L[min2]=min_sum;
        L[min1]=L[N-1];
        N--;
    }  
    cout<<min<<endl;
}

int main()
{
    ios::sync_with_stdio(false);
    while(cin>>N)
        min_money();
}

此处需要注意的一点就是long long类型在这个题是必要的，假设每块的长度都一样，那么最小值都为(深度N每块的长度)，或者说成是N*(层数-1)*每块的长度，那么如果N和L都取到最大，N×L=1000000000，而N=20000时深度也不难算出，带入计算，便知道为什么这个long long类型是必不可少的了。