http://poj.org/problem?id=2891 Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 16849 Accepted: 5630 http://poj.org/problem?id=2891 Descrip ...
分类：
其他好文 时间：
2017-08-13 13:23:56
阅读次数：
137
Tickets Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 924 Accepted Submission(s): 468 Problem ...
分类：
其他好文 时间：
2017-08-11 10:59:16
阅读次数：
179
拓扑排序模版题型: John has n tasks to do.Unfortunately, the tasks are not independent and the execution of one task is only possible if other tasks have alrea ...
分类：
编程语言 时间：
2017-08-11 10:34:32
阅读次数：
201
Kind of a Blur Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2754 Accepted Submission(s): 751 P ...
分类：
其他好文 时间：
2017-08-05 22:46:43
阅读次数：
150
Problem Description Give you an array A[1..n]，you need to calculate how many tuples (i,j,k) satisfy that (i<j<k) and ((A[i] xor A[j])<(A[j] xor A[k])) ...
分类：
其他好文 时间：
2017-08-05 15:38:40
阅读次数：
129
Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 16742 Accepted Submission(s): 728 ...
分类：
其他好文 时间：
2017-08-05 13:22:53
阅读次数：
229
The end of the school year is near and Ms. Manana, the teacher, will soon have to say goodbye to a yet another class. She decided to prepare a goodbye ...
分类：
其他好文 时间：
2017-08-03 17:00:21
阅读次数：
163
Bellman_ford算法用于寻找正环或者负环！ 算法导论： 24.1 The Bellman-Ford algorithm The Bellman-Ford algorithm solves the single-source shortest-paths problem in the gene ...
分类：
编程语言 时间：
2017-08-01 14:40:38
阅读次数：
190
Description Steph is extremely obsessed with “sequence problems” that are usually seen on magazines: Given the sequence 11, 23, 30, 35, what is the ne ...
分类：
其他好文 时间：
2017-07-30 22:08:25
阅读次数：
152
