本文主要是介绍poj 3253 优先队列 堆,希望对大家解决编程问题提供一定的参考价值,需要的开发者们随着小编来一起学习吧!
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 39924 | Accepted: 13022 |
Description
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN (1 ≤ N ≤ 20,000) planks of wood, each having some integer lengthLi (1 ≤ Li ≤ 50,000) units. He then purchases a single long board just long enough to saw into theN 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 theN-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 theN 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
Lines 2.. N+1: Each line contains a single integer describing the length of a needed plank
Output
Sample Input
3 8 5 8
Sample Output
34
Hint
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).
题意:
就是把木头不断的砍开
比如说,砍开长为 20 的,那么就要花费二十的费用
题解:
使用最小堆实现优先队列:
先取出最小的保存
然后维护最小堆
然后再取最小的和之前的相加
继续维护最小堆
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;#define father(i) (i>>1)
#define left(i) (i<<1)
#define right(i) (i<<1|1)
#define swap(a,b) {int t=a;a=b;b=t;}int heap_size;
int a[20010];void min_heapify(int i)
{int l=left(i);int r=right(i);int largest;if(l<=heap_size&&a[l]<a[i])largest=l;elselargest=i;if(r<=heap_size&&a[r]<a[largest])largest=r;if(largest!=i){swap(a[i],a[largest]);min_heapify(largest);}
}void build_min_heap()
{for(int i=heap_size/2;i>=1;i--)min_heapify(i);
}void heap_sort()
{for(int i=heap_size;i>=2;i--){swap(a[1],a[i]);heap_size--;min_heapify(1);}
}int main()
{int n;//freopen("in.txt","r",stdin);scanf("%d",&n);heap_size=n;a[0]=0;for(int i=1;i<=n;i++)scanf("%d",&a[i]);long long ans=0;build_min_heap();for(int i=1;i<n;i++){int temp=a[1];a[1]=a[heap_size];heap_size--;min_heapify(1);a[1]+=temp;ans+=a[1];min_heapify(1);temp=a[1];}printf("%lld\n",ans);return 0;
}
这篇关于poj 3253 优先队列 堆的文章就介绍到这儿,希望我们推荐的文章对编程师们有所帮助!