希望变强大

487-3279 Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 295341 Accepted: 52901 Description Businesses like to have memorable telephone numbers. One way to make a

Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 55238 Accepted: 24770 Description A numeric sequence of ai is ordered if a1 < a2 < … <

The Triangle Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 51206 Accepted: 31010 Description 7 3 8 8 1 0 2 7 4 4 4 5 2 6 5

Charm Bracelet Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 41212 Accepted: 17929 Description Bessie has gone to the mall’s jewelry store and spies a charm bra