zoukankan      html  css  js  c++  java
  • POJ 3253 Fence Repair【哈弗曼树/贪心/优先队列】

    Fence Repair
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 53645   Accepted: 17670

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

    Source

     
    【代码】:
    #include<iostream>
    #include<vector>
    #include<queue>
    using namespace std;
    
    #define LL long long
    using namespace std;
    const int N = 20000+100;
    int n;
    int L;
    int a,b;
    priority_queue<int,vector<int>,greater<int> > q;
    int main()
    {
        cin>>n;
        LL ans=0;
        for(int i=0;i<n;i++)
        {
            cin>>L;
            q.push(L);
        }
        while(q.size()>1)
        {
            a=q.top();
            q.pop();
    
            b=q.top();
            q.pop();
    
            ans += a+b;
            q.push(a+b);
    
    
        }
        cout<<ans<<endl;
        while(!q.empty())  //清空队列
               q.pop();
        return 0;
    }
    哈夫曼裸题
  • 相关阅读:
    HTML5之Canvas绘图——使用Canvas绘制图形的基本教程
    搭建EF6.0+MVC4搭建框架——之路由配置
    搭建EF6.0+MVC4搭建框架遇到的问题及解决方案
    Sql2008 全文索引应用(错误7625)
    Excel 导入并导出结果集
    SqlParameter设定的value值为0时、调用的存储过程获取到的值却为null解决方法
    JavaScript中知而不全的this (转)
    JavaScript 类定义常用方法(转)
    NPOI大数据量多个sheet导出源码(原)
    网页右下角固定图片(不随滚动条滑动,始终在固定位置)
  • 原文地址:https://www.cnblogs.com/Roni-i/p/7912380.html
Copyright © 2011-2022 走看看