Dynamic planning of combined class--energy necklace

Source: Internet
Author: User

Energy Necklace Title Description DescriptionOn Mars planet, each Mars person carries a string of energy necklaces. There are n energy beads on the necklace. The energy bead is a bead with a head mark and a tail marker, which corresponds to a positive integer. Also, for two adjacent beads, the tail mark of the previous bead must be equal to the head mark of the latter bead. Because this is the only way that the two beads can be aggregated into a bead and release the energy that can be absorbed by the suction cup, by means of the suction cup, which is an organ of the Mars Human Energy absorption. If the head of the previous energy bead is marked M, the tail mark is R, the head of the latter energy bead is labeled R, and the tail mark is n, then the energy released by the aggregation is M*r*n (Mars Unit), the newly generated bead has a head labeled M, and the tail mark is n.
When needed, the Mars man uses a suction cup to clamp the two adjacent beads, and the energy is obtained by polymerization until only one bead is left on the necklace. Obviously, the total energy from different aggregation sequences is different, please design an aggregation order so that the total energy released by a string of necklaces is the largest.
For example: The head mark and tail mark of the n=4,4 beads are (2,3) (3,5) (5,10) (10,2). We use a tick to indicate the aggregation of two beads, (j⊕k) represents the energy released by the aggregation of the j,k two beads. Then the energy released by the 4th and 12 beads is:
(4⊕1) =10*2*3=60.
This string necklace can be obtained by an aggregation order of the optimal values, releasing the total energy of
((4⊕1) ⊕2) ⊕3) =10*2*3+10*3*5+10*5*10=710. input/output format input/output Input Format:
The first line of input is a positive integer N (4≤n≤100) that represents the number of beads on the necklace. The second line is n spaces separated by a positive integer, all the numbers are not more than 1000. The number of I is the head mark (1≤i≤n) of the first bead, when i<n< span>, the tail mark of the first bead shall be equal to the head mark of the i+1 bead. The tail mark of the nth bead should be equal to the head mark of the 1th bead.
As for the order of the beads, you can be sure: put the necklace on the table, do not cross, arbitrarily specify the first bead, and then clockwise to determine the order of the other beads.
output Format:
The output is only one row, which is a positive integer E (e≤2.1*109), which is the total energy released for an optimal aggregation order. input and Output sample sample Input/output sample Test point # # Input Sample:Online IDE
<textarea readonly=""></textarea> Sample output:
<textarea readonly=""></textarea> Description DescriptionNOIP 2006 Raise the first question of the group code:

var i,n,j,k,l,maxf:longint;

A:ARRAY[1..300] of Longint;

S:ARRAY[1..300,1..2] of Longint;

SUM,F:ARRAY[1..300,1..300] of Longint;

function Max (x,y:longint): Longint;

Begin

If X>y then exit (x) Else exit (y);

End

Begin

READLN (n);

For I:=1 to N do

Begin

Read (A[i]);

A[i+n]:=a[i];

End

For I:=1 to 2*n-1 do

Begin

S[i,1]:=a[i];

S[I,2]:=A[I+1];

End

For l:=2 to N do

For I:=1 to 2*n-l do

Begin

J:=I+L-1;

f[i,j]:=0;

For K:=i to J-1 do

F[i,j]:=max (f[i,j],f[i,k]+f[k+1,j]+s[i,1]*s[k,2]*s[j,2]);

End

For I:=1 to N do Maxf:=max (maxf,f[i,i+n-1]);

Writeln (MAXF);

End.

Dynamic planning of combined class--energy necklace

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.