OTTFF的博客

Find the nondecreasing subsequences Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1688    Accepted Submission(s): 612 Problem Descr

180. Inversions time limit per test: 0.25 sec. memory limit per test: 4096 KB input: standard output: standard There are N integers (1A[j]. Input The first line of the input

Ultra-QuickSort Time Limit: 7000MS   Memory Limit: 65536K Total Submissions: 48763   Accepted: 17823 Description In this problem, you have to analyze a particular sorti

Two Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1024    Accepted Submission(s): 472 Problem Description Alice gets two sequences A