longshanxiaoxuesheng的博客

B. Gena's Codetime limit per test0.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's the year 4527 and the tanks game that we all kn

A. Buses Between Citiestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBuses run between the cities A and B

B. Rebustime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a rebus of form ? + ? - ? + ? = n, consisting o

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2395题目解法：由于灯具只能由电压低的转向电压高的，则可以得知这个转换是有序的。友nAC：#include #include #include #include #incl

题目链接：http://codeforces.com/contest/664/problem/A题意：输入两个整数a，b,求a，a+1，a+2，........b的最大公约数。a，b不超过100位数解法： 当a==b时，公约数是他本身。当a！= b时，公约数为1。总结：对于英文题，看清题目在做，，，，有时候读懂了题就变简单了AC：#include #include #i

C. Foe Pairstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a permutation p of lengthn. Also you are

B. Wet Shark and Bishopstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputToday, Wet Shark is given n bishops on a10

C. Wet Shark and Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n sharks who grow flowers for Wet

B. Longtail Hedgehogtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis Christmas Santa gave Masha a magic picture

G. Heavy CoinsBahosain has a lot of coins in his pocket. These coins are really heavy, so he always tries to get rid of some ofthe coins by using them when paying for the taxi.Whenever Bahosain

C. Cinematime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoscow is hosting a major international conferenc

D2. Magic Powder - 2time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe term of this problem is the same as

C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowers and two fountains.

B. The Timetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given the current time in 24-hour formathh:mm. F

D. Simple Subsettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA tuple of positive integers {x1, x2, ...,

D. Bear and Two Pathstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBearland has n cities, numbered 1 thr

题目链接：http://codeforces.com/contest/697/problem/C题意：有1~n的n个点，对于第i个点它的2*i与2*i+1有一条无向的边。现在有两种操最，第一种是将从u到v的最短路径上所有边的 权值加上w。第二种是询问u到v最短路劲上的花费是多少。解法：我们可以将从1开始将所有的边画出来，不难发现这就是一棵二叉树。他们的最短路径即为他们到公共父亲的距离。然后

题目链接：http://codeforces.com/contest/689/problem/D题意：给定两个长度相同的数组，a和b。问你在相同的区间中amax=bmin的区间有多少个，数组的范围为200000.解法：我们可以枚举起始点，然后用二分查到amax和bmin相等的左右端点，然后进行区间累加就可以了。对于最大值最小值的查询我们可以采用线段树和RMQ来优化。线段树的查询复杂度是lo

题目链接：http://codeforces.com/problemset/problem/689/C题意：有4个小偷去偷Mike家的巧克力，小偷的包最多装n个。四个小偷一个比一个贪心，他们偷的是前一个的k倍（k不知道）。现在已经知道小偷可能出现的情况次数为m（1e15）。问你求出小偷包的最小容量。解法：设第一个小偷偷了a，则很容易这道小偷包的容量为所有情况中a*k*k*k的最大值。枚举k

关于优先队列,他的实质是一个堆。在头文件中。它默认的排序方式由小到大排，即大的先出对。对于这种数据容器，在c++中我们只需先定义一个 类，然后重载小于号即可。实现如下：struct num{     int x;     bool operator         return x>a.x;//最小值优先    }};int main(){

1.题目链接：http://www.codeforces.com/problemset/problem/706/DD. Vasiliy's Multisettime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputs