zoukankan      html  css  js  c++  java
  • POJ 3253 Fence Repair C++ STL multiset 可解 (同51nod 1117 聪明的木匠)

    Fence Repair
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 53106   Accepted: 17508

    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).
     
     
     
    思路:在集合中每次找最短的两个加起来,算到ans里。
       再将这两个数从集合中删除,把他们的和加入到集合里。
     
      用multiset解的话,插入和查找都是O(log(n)),再加上遍历一遍,总复杂度是:O(nlog(n))。
     
     
     
     
    代码:
    #include <iostream> 
    #include <set>
    using namespace std;
    typedef long long ll;
    
    multiset <int> s;
    
    int main() {
        int n,key;
        cin >> n;
        for(int i = 0;i < n; i++) cin >> key,s.insert(key);
        
        ll ans = 0;
        while(s.size() > 1){
            int k1 = *s.begin();
            s.erase(s.begin());
            int k2 = *s.begin();
            s.erase(s.begin());
            
            int t = k1+k2;
            ans += t;
            
            s.insert(t);
        }
    
        cout << ans << endl;
      return 0;
    }
    //  writen by zhangjiuding
  • 相关阅读:
    python_paramiko_SSHException Invalid requirement, parse error at
    python_实现发送邮件功能
    人生格言-羊皮卷
    xshell的Solarized Dark配色方案
    vim常用的配置
    Hadoop1.2.1 HDFS原理
    Hadoop1.x目录结构及Eclipse导入Hadoop源码项目
    Hadoop1.2.1 出现Warning: $HADOOP_HOME is deprecated.的解决方案
    Hadoop1.2.1 启停的Shell 脚本分析
    Hadoop1.2.1 配置文件详解
  • 原文地址:https://www.cnblogs.com/zhangjiuding/p/7668526.html
Copyright © 2011-2022 走看看