How to solve the problem of hdu1205 eating candy

It's not that difficult to think about it.

Put the most M (max in total) into a column, generating an interval of max-1, for M, other sweets are heterogeneous (total sum-max ), can be used to fill the interval, but if sum-max <max-1, the interval cannot be filled, so there will be adjacent M, not meeting the requirements printf ("NO \ n ");

When sum-max> = max-1, the m interval must be filled with printf ("Yes \ n ");

Note that the sum value is large.

 

Choose one of the different types of candy n (n <= sum-max) to fill in the interval, and then merge M and N to replace the previous m.

Loop back to end

Mmmmm nnnn bbbb vvv CC x

 

 

Insert from the arrow

Bytes

M m

Bytes

Mn m

Bytes

MNB Mn MB

Bytes

Mnbv MNB mnv mbv

Bytes

Mnbv mnbc mnv mbv

Mnbv mnbc mnvx mbv