xuanweiace的博客

题干：给定N朵花的原先的高度，从左到右排列，最多浇水m天，每天只能浇一次，每次使得连续的w朵花的高度增长1，问最后最矮的花的高度最高是多少。ExamplesInput6 2 32 2 2 2 1 1Output2Input2 5 15 8Output9NoteIn the first sample beaver can water...

题干：We define an element aia_iai​ in a sequence "good", if and only if there exists a j(1≤j<i)j(1\le j < i)j(1≤j<i) such that aj<aia_j < a_iaj​<ai​.Given a permutation ppp of integ...

题干：问题描述　　n 个小朋友站成一排。现在要把他们按身高从低到高的顺序排列，但是每次只能交换位置相邻的两个小朋友。　　每个小朋友都有一个不高兴的程度。开始的时候，所有小朋友的不高兴程度都是0。　　如果某个小朋友第一次被要求交换，则他的不高兴程度增加1，如果第二次要求他交换，则他的不高兴程度增加2（即不高兴程度为3），依次类推。当要求某个小朋友第k次交换时，他的不高兴程度增加k。　　...

题干：http://csustacm.com:4803/problem/1083Description寒冰射手艾希新学会了一个技能，艾希通过这个技能成为了一名声名远扬的神箭手，从此再也无人敢侵犯弗雷尔卓德！这个技能的描述如下（假设英雄联盟内的每个人都有一个编号）：假设艾希有x-1(x&gt;=2)x−1(x&gt;=2)个敌人，每个敌人的编号分别为1\;\;1~\;\;x-1x...

题干：Given a sequence of n numbers a1, a2, ..., an and a number of d-queries. A d-query is a pair (i, j) (1 ≤ i ≤ j ≤ n). For each d-query (i, j), you have to return the number of distinct elements in...

题干：In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sor...

题干：Arkady plays Gardenscapes a lot. Arkady wants to build two new fountains. There arenavailable fountains, for each fountain its beauty and cost are known. There are two types of money in the gam...

题干：There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate boss of someone,...

题干：There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.The tree h...