zoukankan      html  css  js  c++  java
  • poj 3253 Fence Repair

    Fence Repair
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 42979   Accepted: 13999

    Description

    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

    3
    8
    5
    8

    Sample Output

    34

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

     

    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    using namespace std;
    int l[50005];
    int main()
    {
        int n;
        while(~scanf("%d",&n))
        {
            memset(l,0,sizeof(n));
            for(int i=0;i<n;i++)
            {
                scanf("%d",l+i);
            }
            long long ans=0;
            while(n>1)
            {
                int sm1=0,sm2=1;
                if(l[sm1]>l[sm2]) swap(sm1,sm2);
                for(int i=2;i<n;i++)
                {
                    if(l[i]<l[sm1])
                    {
                        sm2=sm1;
                        sm1=i;
                    }
                    else if(l[i]<l[sm2])
                    {
                        sm2=i;
                    }
                }
                    long long t=l[sm1]+l[sm2];
                    ans+=t;
    
                    if(sm1==n-1) swap(sm1,sm2);
                    l[sm1]=t;
                    l[sm2]=l[n-1];
                    n--;
    
            }
            printf("%lld
    ",ans);
        }
        return 0;
    }
    View Code

    没割一次,都会分成两段,所以可以看作一个求最小二叉树的题。贪心。据说还可以lg级的算法算出。

    以后再说

  • 相关阅读:
    Atitit.auto complete 自动完成控件的实现总结
    Atitit. .net c# web 跟客户端winform 的ui控件结构比较
    Atitit.实现继承的原理and方法java javascript .net c# php ...
    Atitit.javascript 实现类的方式原理大总结
    Atitit. BigConfirmTips 控件 大数据量提示确认控件的原理and总结O9
    Atitit..组件化事件化的编程模型--(2)---------Web datagridview 服务器端控件的实现原理and总结
    c#类库中使用Session
    Oracle和Redhat下载地址
    IIS (HTTP Error 500.21
    浅淡Windows7 32位与64位/x86与x64的区别
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/6136027.html
Copyright © 2011-2022 走看看