算法题
文章平均质量分 92
珈凝
nice to meet you
展开
-
URL stl map
1715: URLTime Limit(Common/Java):1000MS/10000MS Memory Limit:65536KByteDescriptionWHU ACM Team is working on a brand new web browser named "Whu-Super-Browser". You're in response for a power...原创 2017-08-17 14:10:16 · 275 阅读 · 0 评论 -
Graph’s Cycle Component 并查集
Graph’s Cycle Component Description In graph theory, a cycle graph is an undirected graph that consists of a single cycle, or in other words, some number of vertices connected ...原创 2019-03-25 19:59:47 · 232 阅读 · 0 评论 -
HDU 1069 TOJ 1322 Monkey and Banana(贪心+dp)
DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with some blocks...原创 2019-04-08 21:25:34 · 208 阅读 · 0 评论 -
hdu 2089 不要62, 动态规划
题目描述杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如:62315 73418 88914都属于不吉利号码。但是,61152虽然含有6和2,但不是62连号,所以不属于不吉利数...原创 2019-04-07 22:23:36 · 159 阅读 · 0 评论 -
ZOJ 2972 TOJ 1545 Hurdles of 110m(一般dp)
描述In the year 2008, the 29th Olympic Games will be held in Beijing. This will signify the prosperity of China and Beijing Olympics is to be a festival for people all over the world as well.Liu Xia...原创 2019-04-12 21:03:49 · 216 阅读 · 0 评论 -
toj 2793:石子归并_区间dp
Description有n堆石子排成一条直线,每堆石子有一定的重量。现在要合并这些石子成为一堆石子,但是每次只能合并相邻的两堆。每次合并需要消耗一定的体力,该体力为所合并的两堆石子的重量之和。问最少需要多少体力才能将n堆石子合并成一堆石子?Input输入只包含若干组数据。每组数据第一行包含一个正整数n(2<=n<=100),表示有n堆石子。接下来一行包含n个正整数a1,a2...原创 2019-04-17 21:37:42 · 268 阅读 · 0 评论 -
toj 2741 Hotel booking (spfa+bfs+巧妙构图)
DescriptionA transport company often needs to deliver goods from one city to another city. The transport company has made a special deal with a hotel chain which allows its drivers to stay in the ho...原创 2019-06-19 23:58:24 · 235 阅读 · 0 评论