摘要:
A. Serval and Bus 算出t之后每班车的最早时间,取最小值 B. Serval and Toy Bricks 每个有方块的位置尽可能取高,即min(a[j], b[i]) C. Serval and Parenthesis Sequence 统计一下要放多少的(和),显然前面尽量放(是 阅读全文
摘要:
SUBLEX Lexicographical Substring Search Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing tha 阅读全文
摘要:
Adding New Machine Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1555 Accepted Submission(s): 阅读全文