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

    Fence Repair
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 24252   Accepted: 7766

    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).
     
    维护一个最小堆问题,有哈夫曼思想,用优先队列实现。
     
     1 #include <iostream>
     2 #include <queue>
     3 #include <cstdio>
     4 using namespace std;
     5 
     6 struct Info{
     7     int s;
     8     bool operator < (const Info&a) const
     9     {
    10         return a.s < s;
    11     }
    12 };
    13 int main()
    14 {
    15     priority_queue<Info>pq;
    16     Info info,s1,s2;
    17     int n,a;
    18     while(scanf("%d",&n)!=EOF){
    19         for(int i = 0; i < n; i++){
    20             scanf("%d",&a);
    21             info.s = a;
    22             pq.push(info);
    23         }
    24         long long sum = 0,sum1 = 0;
    25         while(1){
    26             s1 = pq.top();
    27             pq.pop();
    28             s2 = pq.top();
    29             pq.pop();
    30             sum1 = s1.s+s2.s;
    31             sum += sum1;
    32             if(pq.empty() == true) break;
    33             info.s = sum1;
    34             pq.push(info);
    35         }
    36         printf("%lld
    ",sum);
    37     }
    38     return 0;
    39 }
    View Code
     
    Do one thing , and do it well !
  • 相关阅读:
    Python 序列化处理
    httpclient
    java获取配置文件中变量值
    利用数据库管理工具(Navicat)导出数据到Excel表中
    如何确保发布的项目是最新的
    上传文件,重命名
    Mybatis plus中一个框多条件查询 SQL拼接
    用eclipse发布springboot项目
    使用SQL命令行更改数据库字段类型
    Java中查询某个日期下所有时间段的数据
  • 原文地址:https://www.cnblogs.com/ubuntu-kevin/p/3746340.html
Copyright © 2011-2022 走看看