It's Maverick.


【HDU1512】【左偏树】Monkey King 题解

Monkey KingOnce in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them knows each oth...

2017-07-17 21:07:39

阅读数 342

评论数 0

【HDU3488】【网络流】【最小费用最大流】Tour 题解

In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to hav...

2017-06-07 19:13:06

阅读数 366

评论数 0

【HDU3045】【斜率优化DP】Picnic Cows题解

Picnic CowsIt’s summer vocation now. After tedious milking, cows are tired and wish to take a holiday. So Farmer Carolina considers having a picnic b...

2017-05-19 17:08:19

阅读数 250

评论数 0

【HDU3507】【斜率优化DP】Print Article题解

Zero has an old printer that doesn’t work well sometimes. As it is antique, he still like to use it to print articles. But it is too old to work for ...

2017-05-13 11:50:46

阅读数 230

评论数 0

【HDU4691】【后缀数组】Front compression 题解

Front compression翻译见后DescriptionFront compression is a type of delta encoding compression algorithm whereby common prefixes and their lengths are rec...

2017-03-10 21:48:19

阅读数 411

评论数 0

【HDU5770】【线段树】【扫描线】Treasure 题解

Treasure?? has got a treasure map,the treasure map consists of N nodes,there are N-1 bidirectional roads, Each of them connects a pair of nodes,the N...

2017-02-12 21:42:30

阅读数 301

评论数 0

【HDU5900】【区间DP】QSC and master 题解

QSC and masterEvery school has some legends, Northeastern University is the same. Enter from the north gate of Northeastern University,You are facing...

2017-02-12 21:13:52

阅读数 317

评论数 0

取消 删除