![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
###### 其他 ######
至此曾经
从未坚持?
展开
-
codeforces 814C An impassioned circulation of affection
C. An impassioned circulation of affectiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNadeko's birthday is approaching! As she decor原创 2017-06-07 23:51:51 · 691 阅读 · 2 评论 -
计蒜客 query on a string
You have two strings SS and TT in all capitals.Now an efficient program is required to maintain a operation and support a query.The operation C~i~chC i ch with given integer ii and capital let原创 2017-09-13 17:57:10 · 236 阅读 · 0 评论 -
codeforces 846B Math Show
B. Math Showtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp takes part in a math show. He is given n tasks, each consists of k s原创 2017-09-06 19:27:34 · 604 阅读 · 0 评论 -
codeforces 846F Random Query
F. Random Querytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array a consisting of n positive integers. You pick two原创 2017-09-06 19:43:06 · 490 阅读 · 0 评论 -
coderforces 846D Monitor
D. Monitortime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Luba bought a monitor. Monitor is a rectangular matrix of size n × m.原创 2017-09-06 20:00:20 · 403 阅读 · 0 评论 -
hdu 6215 Brute Force Sorting
Problem DescriptionBeerus needs to sort an array of N integers. Algorithms are not Beerus's strength. Destruction is what he excels. He can destroy all unsorted numbers in the array simultaneously.原创 2017-09-17 20:02:30 · 254 阅读 · 0 评论 -
CSUOJ 2005 nearest maintenance point
DescriptionA county consists of n cities (labeled 1, 2, …, n) connected by some bidirectional roads. Each road connects a pair of distinct cities. A robot company has built maintenance points in s原创 2017-09-11 14:23:01 · 383 阅读 · 0 评论 -
hdu 5289 Assignment
Problem DescriptionTom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task原创 2017-09-21 17:34:53 · 185 阅读 · 0 评论 -
51nod 1621 花钱买车牌 (贪心)
一个车牌号由n位数字组成。如果一个车牌至少有k位数字是相同的,那么我们就说这个车牌漂亮的车牌。现在华沙想要改变他自己的车牌,使得他的车牌变得漂亮。当然,改车牌是要花钱的。每改变一位数字所要花费的费用等于当前位上的新旧数字之差的绝对值。那么总费用就是每位上所花费用的总和。举例如下,旧牌为0123,新牌为7765,那么对应第一位所花费用为|0-7|=7,第二位为|1-7|=6,第三位为原创 2017-10-16 11:37:22 · 874 阅读 · 0 评论