- 博客(6)
- 资源 (7)
- 收藏
- 关注
RSS订阅原创 线段树区间合并（POJ 3667 Hotel ，HDU HDU3308 LCIS）
对于线段树的合并，需要建立左右区间的ans，和整个区间的ans。LCIS只需要更新就行，二hotel则要用到区间的更新和合并。LCIS：//#define zhouV#include#include#include#include #include#include using namespace std;#define LL long long int cons
2016-01-25 09:56:03
348
原创 Codeforces Round #340 (Div. 2) C
C. Watering Flowerstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA flowerbed has many flowers and two fountains.
2016-01-24 13:55:26
277
原创 B. Longtail Hedgehog
B. Longtail Hedgehogtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis Christmas Santa gave Masha a magic picture
2016-01-22 21:30:15
563
原创 HDU 1698（线段树区间更新）
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24705 Accepted Submission(s): 12322Problem DescriptionIn the game
2016-01-21 14:39:46
208
原创 codeforces 614B
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
2016-01-19 19:28:03
416
原创 最大m子段和HDU1024
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22126 Accepted Submission(s): 7423Problem DescriptionNow I t
2016-01-18 11:04:54
209
背包问题九讲2.0
2016-03-03
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人