2017年04月_墨碎江南

原创 Stealing Harry Potter's Precious hdu 4771 （搜索）

Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon’s home. But he can’t bring his pre

2017-04-30 15:54:21 259

原创 Advanced Fruits(最长公共子序列）

Advanced FruitsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 3367 Accepted Submission(s): 1730 Special JudgeProblem Description The comp

2017-04-29 18:54:54 395

原创河工大校赛

1269: 爱看电视的LsF 时间限制: 1 秒内存限制: 64 MB 提交: 269 解决: 63 提交状态题目描述LsF（刘师傅）非常喜欢看电视！不幸的是，遥控器上的一些数字按钮坏了。但他灵光一闪，如果他不能直接输入他想要看到的频道的号码，那么他可以先输入其他号码，再通过按下按钮+ 和- （这两个按钮由24K钛合金制成，永远不会坏）的方式到达所需的频道。按钮+将数字增

2017-04-24 18:40:47 327

转载 ZOJ - 2339霍夫曼树

You might have heard about Huffman encoding - that is the coding system that minimizes the expected length of the text if the codes for characters are required to consist of an integral number of bits.

2017-04-21 10:48:32 183

原创最短路spfa

spfa可以处理负权回路什么是负权回路：如果存在一个环（从某个点出发又回到自己的路径），而且这个环上所有权值之和是负数，那这就是一个负权环，也叫负权回路如果一条边是负值而且这个图是无向图那么肯定是有负权回路最小值能在2 3间不断更新如果一条边是负值但是这个图是有向图但是可以不断走 1 2 3 来不断更新但是这个图就没有负权回路 #include#incl

2017-04-19 21:13:59 278

原创离散化

#include#include#include#include#include#include#include#include#define inf 0x3f3f3f3f#define ll long long#define N 100000+10using namespace std;int a[10]={1,100,1000,1000,1000

2017-04-19 12:36:39 184

原创 Beautiful People ZOJ - 2319

The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbered by the time they entere

2017-04-19 08:37:41 227

原创 Beautiful People ZOJ - 2319(单调递增最长子序列）

The most prestigious sports club in one city has exactly N members. Each of its members is strong and beautiful. More precisely, i-th member of this club (members being numbered by the time they entere

2017-04-18 21:01:28 234

原创 Rikka with Tree HDU - 5423

As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: For a tree TT, let F(T,i)F(T,i) be the distance b

2017-04-12 10:56:41 206

原创 Bored Three-God

J - Bored Three-God NBUT - 1228 The bored Three-God get another boring question. This problem is ask you plus two big nubmer, please help him, when you solve this problem you canspea

2017-04-09 10:30:31 278

原创 Kindergarten Election ZOJ - 3715 （枚举+贪心）

K - Kindergarten Election ZOJ - 3715 题意：有个小屁孩想当班级扛把子他可以用糖果收买别人最后要求他的票数是最多的，其他人都比他少。我们就能枚举假设他K票当选则其他人票数一定小于K。我们让超过K票的人票数变为K-1 多的票给1号。若是现在都小于K然而1的票还是少于K则从花费最少糖果且未被标记的人那边拿票直至等于K；

2017-04-08 14:12:26 380

原创高桥和低桥 CSU - 1335

有个脑筋急转弯是这样的：有距离很近的一高一低两座桥，两次洪水之后高桥被淹了两次，低桥却只被淹了一次，为什么？答案是：因为低桥太低了，第一次洪水退去之后水位依然在低桥之上，所以不算“淹了两次”。举例说明：假定高桥和低桥的高度分别是5和2，初始水位为1第一次洪水：水位提高到6（两个桥都被淹），退到2（高桥不再被淹，但低桥仍然被淹）第二次洪水：水位提高到8（高桥又被淹了），退到3。没错，

2017-04-06 16:36:41 329

原创最大长方形（二）

最大长方形（二）时间限制：1000 ms | 内存限制：65535 KB难度：4描述Largest Rectangle in a HistogramA histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rec

2017-04-05 16:29:50 198 1

dsaghjkye的博客