ayit第十六周训练题的e题
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
#include
#include
#include
using namespace std;
int a[30010];
int main()
{
int m,m1,m2,i,j,t;
long long ane=0;
scanf("%d",&m);
for(i=0;i1)
{
m1=0,m2=1;
if(a[m1]>a[m2])
swap(m1,m2);
for(i=2;i 题意 有一个农夫要把一个木板锯成几块给定长度的小木板，每次锯都要收取一定费用，这个费用就是当前锯的这个木板的长 度，给定小木板的个数n，及各个要求的小木板的长度，求最小费用。
思路 要使总费用最小，那么每次只选取最小长度的两块木板相加，再把这些“和”累加到总费用中就可以了。