A.
The end point was determined LIS each position number, and then seek the anti again. Multiply the positive and negative results of this position is to appear in a number of LIS.
It was a few minutes after, I feel this practice a few minutes write Come on, do not know the original title, there are simple practices?
B.
First enumerator to the first 14 cards, and then enumerate bird head, determine the legality of the rest.
Note then 11,322 such data, first determine if there will be problems pung
C.
n is the number of values contained sg 2, n can be determined and then into an binary number 0 ~ k comprising a number of 2
Then there fwt + fast power, and as pe560
D.
A single set of data 500 million, or start directly with the priority queue, so O (nlogn) should be able to live it, but TLE
Therefore, from front to back into enumeration, 26 engage each character position memory queues up the remaining length of the <start selected from the smallest characters put inside = k
E.
The feel of it, and direct prev_permutation next_permutation violence
F/G.
No time to read