贱人方

摘要： Necklace frog has \(n\) gems arranged in a cycle, whose beautifulness are \(a_1, a_2, \dots, a_n\). She would like to remove some gems to make them in 阅读全文

摘要： Did Pong Lie? 题目描述 Doctor Pong has two arrays of integers : a1 , a2 , ......, aN and b1 , b2 , ......, bM . His student Rong wants to know what these 阅读全文

摘要： Rikka with Sequence Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2777 Accepted Submission(s): 阅读全文

摘要： Travel The country frog lives in has \(n\) towns which are conveniently numbered by \(1, 2, \dots, n\). Among \(\frac{n(n - 1)}{2}\) pairs of towns, \ 阅读全文

摘要： Vertex Cover frog has a graph with \(n\) vertices \(v(1), v(2), \dots, v(n)\) and \(m\) edges \((v(a_1), v(b_1)), (v(a_2), v(b_2)), \dots, (v(a_m), v( 阅读全文

摘要： I. Beautiful Array 2017- BUPT Collegiate Programming Contest - sync I. Beautiful Array 2017- BUPT Collegiate Programming Contest - sync 时间限制 1000 ms 内 阅读全文

摘要： H. Black-white Tree 2017- BUPT Collegiate Programming Contest - sync H. Black-white Tree 2017- BUPT Collegiate Programming Contest - sync 时间限制 1000 ms 阅读全文

摘要： F. Gabriel's Pocket Money 2017- BUPT Collegiate Programming Contest - sync F. Gabriel's Pocket Money 2017- BUPT Collegiate Programming Contest - sync 阅读全文

摘要： Counting Intersections Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1138 Accepted Submission( 阅读全文

摘要： Road Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1132 Accepted Submission(s): 309 Problem De 阅读全文