hongxdong的专栏

 Verdis QuoTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 282    Accepted Submission(s): 212Problem DescriptionThe Romans used letters

 GPATime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 317    Accepted Submission(s): 194Problem DescriptionEach course grade is one of the

  Name PK Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 148    Accepted Submission(s): 75Problem DescriptionName PK is a funny game on

 An easy problemTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1505    Accepted Submission(s): 302Problem DescriptionWhen Teddy was a c

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2080    Accepted Submission(s): 669Problem DescriptionMany years ago , in Te

N!Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12267    Accepted Submission(s): 2979Problem DescriptionGiven an integer N(0 ≤ N ≤ 1000

  //不用STL 写的BFS， 要用head 和 tail 标记 step 、 layer 数组。// step 用来记录BFS 遍历的所有节点， layer 用来记录节点当前的层数 : layer[tail] = layer[head] + 1。// 在一些要求记录最短路径的题型中， // layer 可以用来记录前驱节点: layer[tail ] = head; //