- 博客(15)
- 资源 (4)
- 收藏
- 关注
原创 Invitation Cards HDU - 1535 基础最短路
In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They
2017-08-25 21:38:49 369
原创 HDU Today HDU - 2112 模板最短路
经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。 这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在什么地方下车(其实徐总自己有车,却一定要
2017-08-25 20:36:34 330
原创 Squares POJ2002 哈希的应用
A square is a 4-sided polygon whose sides have equal length and adjacent sides form 90-degree angles. It is also a polygon such that rotating about its centre by 90 degrees gives the same polygon. It
2017-08-16 22:21:30 324
原创 Air Raid POJ1422 & HDU1151 最小路径覆盖
Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you can
2017-08-14 16:17:24 377
原创 IMMEDIATE DECODABILITY POJ - 1056 (字典树)
An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary,
2017-08-13 16:07:10 332
原创 Xor Sum HDU - 4825 (字典树的运用)
Zeus 和 Prometheus 做了一个游戏,Prometheus 给 Zeus 一个集合,集合中包含了N个正整数,随后 Prometheus 将向 Zeus 发起M次询问,每次询问中包含一个正整数 S ,之后 Zeus 需要在集合当中找出一个正整数 K ,使得 K 与 S 的异或结果最大。Prometheus 为了让 Zeus 看到人类的伟大,随即同意 Zeus 可以向人类求助。你能证明人类
2017-08-13 13:32:23 282
原创 Shortest Prefixes POJ - 2001 (字典树模板题~)
A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "car", "carb", "carbo", and "carbon". Note that the empty string is not co
2017-08-13 13:27:07 327
原创 Einbahnstrasse HDU - 2923 (Floyd, 注意建图)
题目描述 Einbahnstra e (German for a one-way street) is a street on which vehicles should only move in one direction. One reason for having one-way streets is to facilitate a smoother flow of traffic
2017-08-12 17:32:59 271
原创 POJ 2355 Railway tickets 线性DP
题目地址~ 题目大意: X为距离 , 当0C1。 L1C2。L2 思路: 线性dp, 直接在for循环里判断就好了, dp[i] = min(dp[j]+cost, 0 AC CODE: #include #include #include using namespace std; int dp[10010]; int main(void) { in
2017-08-12 17:10:38 365
原创 Max Sum HDU - 1003 求最大和
HDU 1003 题目描述 Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +
2017-08-12 17:00:27 419
原创 Super Jumping! Jumping! Jumping! HDU - 1087
题目地址 Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I introduce it to you now.
2017-08-12 16:41:52 247
原创 第一篇博客, 记录一下
转眼大学一年过去了。 一年前的现在刚刚了解到C语言并输出第一个程序 "Hello World"。一年过去了学到了什么我自己并不清楚。 感觉大二不能这么荒废下去了, 开个博客记录记录自己的学习历程。 明天把暑假集训的内容整理整理并写下题解。
2017-08-12 11:36:47 265
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人