摘要：题意：对一根长为l的木棒进行切割，给出n个切割点，每次切割的价值，等于需要切割的木头长度。 一开始理解错了，认为切割点时根据当前木条的左端点往右推算。 实际上，左端点始终是不变的一直是0，右端点一直是l，切割点就是在0 ~ l 之间的点，而切割时的价值就是切割这个点的时候当前木条的长度。 状态转移方 阅读全文

摘要：Chladni Figure CodeForces - 1162D Inaka has a disc, the circumference of which is nn units. The circumference is equally divided by nn points numbered 阅读全文

摘要：Necklace HDU - 3874 Mery has a beautiful necklace. The necklace is made up of N magic balls. Each ball has a beautiful value. The balls with the same 阅读全文

摘要：Problem for Nazar Nazar, a student of the scientific lyceum of the Kingdom of Kremland, is known for his outstanding mathematical abilities. Today a m 阅读全文

摘要：Align AtCoder - 4371 Problem Statement You are given N integers; the i-th of them is Ai. Find the maximum possible sum of the absolute differences bet 阅读全文

摘要：B. Long Number time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Long Number time limit 阅读全文