- 博客(11)
- 资源 (4)
- 收藏
- 关注
原创 JZOJ1517.2017.05.27【提高组】模拟赛C组 T1背包问题
Description从T组物品中选出一些物品,放入背包中,求剩余空间的最小值。 限制条件:从每组物品中挑选物品必须要选取连续的一段。就是说,如果这组物品共有n个: 物品1、物品2、物品3、…、物品n,那么只能选取物品i、物品i+1、…、物品j,其中1<=i<=j<=n,或者不选。Input第一行为两个用空格隔开的正整数v和T。表示背包的空间和物品的组数。接下来有T行,每行先是一个正整数ni,表示
2017-05-28 15:33:18 446
原创 JZOJ2135.2017.05.20【usaco2017_Mar Bronze & Silver】C组T3Modern Art
题目描述 Art critics worldwide have only recently begun to recognize the creative genius behind the great bovine painter, Picowso. Picowso paints in a very particular way. She starts with an N×Nblank c
2017-05-22 19:17:37 847
原创 2017.05.20【usaco2017_Mar Bronze & Silver】C组题解
第一次做英文原题,我…………这keng…… 这套题,真心简单 但是很久没写博客了,不要让懒癌支配了 所以以下是题解T1: http://blog.csdn.net/enjoy_pascal/article/details/72580342T2: http://blog.csdn.net/enjoy_pascal/article/details/72581028T3: LOADINGT4:
2017-05-20 16:51:39 1076
原创 JZOJ2137.2017.05.20【usaco2017_Mar Bronze & Silver】C组T5Bovine Genomics
题目描述Farmer John owns N cows with spots and N cows without spots. Having just completed a course in bovine genetics, he is convinced that the spots on his cows are caused by mutations in the bovine geno
2017-05-20 16:47:07 713
原创 JZOJ2136.2017.05.20【usaco2017_Mar Bronze & Silver】C组T4Paired Up
题目描述Farmer John finds that his cows are each easier to milk when they have another cow nearby for moral support. He therefore wants to take his M cows (M≤1,000,000,000, M even) and partition them into
2017-05-20 16:35:04 757
原创 JZOJ2134.2017.05.20【usaco2017_Mar Bronze & Silver】C组T2Bovine Genomics
题目描述 Farmer John owns N cows with spots and N cows without spots. Having just completed a course in bovine genetics, he is convinced that the spots on his cows are caused by mutations at a single l
2017-05-20 16:21:58 660
原创 JZOJ2133.2017.05.20【usaco2017_Mar Bronze & Silver】C组T1The Lost Cow
题目描述 Farmer John has lost his prize cow Bessie, and he needs to find her! Fortunately, there is only one long path running across the farm, and Farmer John knows that Bessie has to be at some loc
2017-05-20 16:16:06 1329
原创 JZOJ1248.【USACO题库】1.3.3 Calf Flac
题目描述据说如果你给无限只母牛和无限台巨型便携式电脑(有非常大的键盘),那么母牛们会制造出世上最棒的回文。你的工作就是去这些牛制造的奇观(最棒的回文)。在寻找回文时不用理睬那些标点符号、空格(但应该保留下来以便做为答案输出),只用考虑字母’A’-‘Z’和’a’-‘z’。要你寻找的最长的回文的文章是一个不超过20,000个字符的字符串。我们将保证最长的回文不会超过2,000个字符(在除去标点符号、空格
2017-05-15 20:42:01 565
原创 JZOJ1250.【USACO题库】1.4.2 The Clocks
题目描述考虑将如此安排在一个 3 x3 行列中的九个时钟:|——-| |——-| |——-|| | | | | | ||—O | |—O | | O || | | | | ||——-| |——-| |——-|A B
2017-05-12 20:21:59 728
原创 五月联考的总(lao)结(sao)
这个星期四和星期五就是传说中的五月联考 然而 今天就是星期五~怎么说好呢 这个联考是第二次期中考了 (第一次期中考→ http://blog.csdn.net/enjoy_pascal/article/details/70175764) so?这次只考三科,三鑫那边才考七科 于是乎考完数学的我变得无所事事
2017-05-12 19:18:03 1098
原创 JZOJ1271.【USACO题库】2.4.1 The Tamworth Two两只塔姆沃斯牛
题目描述两只牛在森林里故意走丢了。农民John开始用他的专家技术追捕这两头牛。你的任务是模拟他们的行为(牛和John)。追击在10x10的平面网格内进行。一个格子可以是:一个障碍物,两头牛(它们总在一起), 或者农民John.两头牛和农民John可以在同一个格子内(当他们相遇时),但是他们都不能进入有障碍的格子。一个格子可以是:. 空地障碍物C 两头牛F 农民John这里有一个地图的例子::……
2017-05-05 20:35:56 636
subline-text-3插件MinGW.zip
2018-01-24
Sublime Text Build 3126.zip
2018-01-22
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人