终有绿洲摇曳在沙漠

1.题目描述：B. Vanya and Lanternstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVanya walks late at night

1.题目描述：C. Sagheer and Nubian Markettime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOn his trip to Lu

1.题目描述：B. Summer sell-offtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSummer holidays! Someone is

1.题目描述：C. Do you want a date?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeha decided to move to

1.题目描述：B. Makes And The Producttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter returning from

1.题目描述：A. The Contesttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPasha is participating in a con

1.题目描述：time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr has got a large array of size n. Amr doesn't

1.题目描述：A. Lala Land and Apple Treestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAmr lives in Lala

1.题目描述：C. Load Balancingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the school computer roo

1.题目描述：D. The Union of k-Segmentstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are g

1.题目描述：C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowe

1.题目描述：B. Anton and Linestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe teacher gave Anton a lar

Help Chef Gerasim 题目链接 分类：implementation sortings1.题意概述给你n个茶杯，里面分别有a[i]毫升的水，现在要你最多倒一次使得所有杯子里面水的容量相同。2.解题思路直接排序以后，最终答案就是总容量总杯子数\frac{总容量}{总杯子数}，让水最多的倒给最少的即可，还有一些trick点，比如总杯子数不能整除总容量，还有需要倒多次的情

1.题目描述：E. Selling Souvenirstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter several latest refo

1.题目描述：B.XC的缎带（黄色）成绩0开启时间2017年05月14日 Sunday 09:30折扣0.8折扣时间2017年05月12日 Friday 19:55允许迟交是关闭时间2017年05月14日 Sunday 15:00题目描述女孩子都喜欢漂亮的缎带，XC也不例

1.题目描述：B. Sort the Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBeing a programmer, you like

1.题目描述：B. Case of Fugitivetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAndrewid the Android is a

1.题目描述：B. Qualifying Contesttime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVery soon Berla

1.题目描述：SOLDIERSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8490 Accepted: 2993DescriptionN soldiers of the land Gridland are randomly scatte

1.题目描述：VisitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 855    Accepted Submission(s): 286Problem DescriptionWangye is

1.题目描述：B. Mahmoud and a Triangletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud ha

1.题目描述：B. USB vs. PS/2time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDue to the increase in the num

1.题目描述：C. Dishonest Sellerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIgor found out

2.中文题意概述：在一条路上有 n 座城市。每座城市与你现在所处的位置的距离分别为 a1, a2, ..., an。保证a数组的值互不相同。现在小L想知道，距离最近的两座城市之间的距离是多少，又有多少对城市之间的距离最近。Input第一行包含一个大整数 n (2 ≤ n ≤ 2·105).第二行包含 n 个整数 a1, a2, ..., an ( - 109

1.题目描述：C. Naming Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOleg the client and Igor the

1.题目描述：D. Mike and distributiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMike has al

1.题目描述：B. Kefa and Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputKefa wants to celebrate hi

Animals 题目链接 分类： greedy1.题意概述有某类动物，要在农场中待n(1 ≤ n ≤ 100)n(1 ≤ n ≤ 100)天，第ii天，这类动物要吃的粮食为cic_i，现在初始粮草是X(1≤X≤104)X(1≤X≤10^4)，问你最多可以容纳几只动物（动物可以中途来，但是不能中途走）？2.解题思路我们先把第i天到最后1天所需的粮食求出来，再排序一下，然后贪心地选