C - Mike and Frog CodeForces - 548C(循环节,暴力)

摘要: Mike has a frog and a flower. His frog is named Xaniar and his flower is named Abol. Initially(at time 0), height of Xaniar is h1... 阅读全文
posted @ 2019-03-28 20:47 tomjobs 阅读(138) 评论(0) 推荐(0) 编辑

D-D. Gluttony(构造)

摘要: D. Gluttonytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an... 阅读全文
posted @ 2019-03-28 20:26 tomjobs 阅读(126) 评论(0) 推荐(0) 编辑

C - Pride CodeForces - 892C(gcd,构造,思维)

摘要: You have an array a with length n, you can perform operations. Each operation is like this: choose two adjacent elements from a, ... 阅读全文
posted @ 2019-03-28 15:08 tomjobs 阅读(174) 评论(0) 推荐(0) 编辑

L1-002 打印沙漏 (20 分)(模拟,规律,二分)

摘要: L1-002 打印沙漏 (20 分)本题要求你写个程序把给定的符号打印成沙漏的形状。例如给定17个“*”,要求按下列格式打印所谓“沙漏形状”,是指每行输出奇数个符号;各行符号中心对齐;相邻两行符号数差2;符号数先从大到小顺序递减到1,再从小到大顺序递增;首尾... 阅读全文
posted @ 2019-03-28 14:35 tomjobs 阅读(184) 评论(0) 推荐(0) 编辑

B - Wrath CodeForces - 892B(思维,水题)

摘要: Hands that shed innocent blood!There are n guilty people in a line, the i-th of them holds a claw with length Li. The bell rings ... 阅读全文
posted @ 2019-03-28 14:28 tomjobs 阅读(193) 评论(0) 推荐(0) 编辑

A - Greed CodeForces - 892A(水题)

摘要: Jafar has n cans of cola. Each can is described by two integers: remaining volume of cola ai and can’s capacity bi (ai ≤ bi).Ja... 阅读全文
posted @ 2019-03-28 13:15 tomjobs 阅读(273) 评论(0) 推荐(0) 编辑

D - Mike and Feet CodeForces - 548D(单调栈)

摘要: Mike is the president of country What-The-Fatherland. There are n bears living in this country besides Mike. All of them are stan... 阅读全文
posted @ 2019-03-28 00:09 tomjobs 阅读(155) 评论(0) 推荐(0) 编辑

H小明买年糕(前缀和+二分)

摘要: Description过年了,小明准备去超市买年糕,超市里共有nn种年糕,每种年糕数量无限多,从1~n编号,每种年糕有自己的价格wiwi和美味值vivi。小明选购年糕的过程如下:1、小明打算去买m次年糕,每次选购区间[Li, Ri][Li,Ri]内的年糕,每... 阅读全文
posted @ 2019-03-27 22:19 tomjobs 阅读(183) 评论(0) 推荐(0) 编辑

千万别点进来,点进来你就哭了(最短路,dijkstra)

摘要: DescriptionPY利用寒假摸鱼时间去了一趟香港吃吃吃,下面就由我介绍一下我遇到的好吃的香港美食。首先介绍第一家合益泰小食,这家主打肠粉,这家的肠粉特别的正宗,价格非常亲民,口感非常好公和荳品厂,这家的豆腐花特别好吃,超级嫩,口感又香又滑。添好运——这... 阅读全文
posted @ 2019-03-27 22:19 tomjobs 阅读(105) 评论(0) 推荐(0) 编辑

E寻宝(贪心)

摘要: Description在一维坐标轴上有许多宝藏,总共n种宝藏,每种宝藏有k个。现在共k个人寻宝,k个人初始位置可以位于任意点。但是每人需要按指定顺序捡起宝藏(1->2->3->…->n,先捡第1种,再捡第2种。。。最后捡第n种宝藏,每种宝藏捡起一个)。每个人... 阅读全文
posted @ 2019-03-27 22:19 tomjobs 阅读(215) 评论(0) 推荐(0) 编辑