zoukankan      html  css  js  c++  java
  • poj3253 哈夫曼树

    Fence Repair
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 19664   Accepted: 6237

    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<algorithm>
     3 #include<queue>
     4 
     5 using namespace std;
     6 
     7 int main()
     8 {
     9     long long int i,n,a,aa,aaa;
    10     priority_queue<int,vector<int>,greater<int> >q;
    11     cin>>n;
    12     for(i=0;i<n;i++)
    13     {
    14         cin>>a;
    15         q.push(a);
    16     }
    17     aaa=0;
    18     while(!q.empty())
    19     {
    20         a=q.top();
    21         q.pop();
    22         if(q.empty())
    23         break;
    24         else{
    25             aa=q.top();
    26             q.pop();
    27             aa+=a;
    28             aaa+=aa;
    29             q.push(aa);
    30         }
    31     }
    32     cout<<aaa<<endl;
    33     return 0;
    34 }
    View Code

    用c写的:

     1 #include<stdio.h>
     2 #define N 2000000001
     3 int n;
     4 int f[5000001];
     5 
     6 int dp()
     7 {
     8     int i,a;
     9     int j=N,k=N;
    10     for(i=1;i<=n;i++)
    11     {
    12         if(j>f[i])
    13         {
    14             j=f[i];
    15             a=i;
    16         }
    17     }
    18     f[a]=N;
    19     for(i=1;i<=n;i++)
    20     {
    21         if(k>f[i])
    22         {
    23             k=f[i];
    24             a=i;
    25         }
    26     }
    27     f[a]=j+k;
    28     return (j+k);
    29 }
    30 
    31 int main()
    32 {
    33     int i;
    34     long long int min=0;
    35     scanf("%d",&n);
    36     for(i=1;i<=n;i++)
    37     scanf("%d",&f[i]);
    38     for(i=1;i<n;i++)
    39     min+=dp();
    40     printf("%lld\n",min);
    41     return 0;
    42 }
    View Code

    用long long 才能AC.

  • 相关阅读:
    javascript练习:87设置对象事件的方法
    javascript练习:810事件与this运算符
    SQL: case when的用法(转)
    C++ :stringstream介绍,使用方法与例子(转)
    【玩转.Net MF – 01】Flash远程读写
    【.Net Micro Framework PortingKit – 13】LCD驱动开发
    【玩转.Net MF – 03】远程文件查看器
    【玩转.Net MF – 02】让PC成为MF的鼠标键盘
    【.Net Micro Framework PortingKit – 12】SysTick驱动开发
    【.Net Micro Framework PortingKit – 11】NandFlash驱动开发
  • 原文地址:https://www.cnblogs.com/sdutmyj/p/3223326.html
Copyright © 2011-2022 走看看