letterwuyu的专栏

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5336题意：水滴游戏，有水珠，水珠size>4时会变成4个水滴流向四方水滴之间流动不相互影响，一个水滴遇到水珠时会融入水珠，水珠size+1，开始给出一个坐标表示在此位置当有一个水珠迸发，求t秒以各个水珠的情况，如果以迸发计算出迸发的时刻，如果没有计算出姿此时水珠的size分析直

Play GameTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 805    Accepted Submission(s): 464Problem DescriptionAlice and Bob are play

Ocean CurrentsTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1561    Accepted Submission(s): 516Problem DescriptionFor a boat on a

Marriage Match IIITime Limit: 10000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1491    Accepted Submission(s): 440Problem DescriptionPresumably,

The ChessTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 466    Accepted Submission(s): 130Problem DescriptionMr Li likes playing ch

Harry Potter and the Forbidden ForestTime Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1549    Accepted Submission(s): 528Problem Descri

MatrixTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1792    Accepted Submission(s): 958Problem DescriptionYifenfei very like play

TIANKENG’s rice shopTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 345    Accepted Submission(s): 71Problem DescriptionTIANKENG man

Going HomeTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2987    Accepted Submission(s): 1513Problem DescriptionOn a grid map ther

胜利大逃亡(续)Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5411    Accepted Submission(s): 1863Problem DescriptionIgnatius再次被魔王抓走了(搞不懂他

非常可乐Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5109    Accepted Submission(s): 2060Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是

推箱子Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5318    Accepted Submission(s): 1493Problem Description推箱子是一个很经典的游戏.今天我们来玩一个简单版本.

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1195

原文链接：http://acm.hdu.edu.cn/showproblem.php?pid=3917分析：

Destroying the bus stationsTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2240    Accepted Submission(s): 716Problem DescriptionGab

Oil DepositsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12655    Accepted Submission(s): 7359Problem DescriptionThe GeoSurvComp

PIGSTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16630 Accepted: 7457DescriptionMirko works on a pig farm that consists of M locked pig-houses and Mi

Marriage Match IVTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2170    Accepted Submission(s): 653Problem DescriptionDo not sincer

Segment setTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3599    Accepted Submission(s): 1346Problem DescriptionA segment and all

Line belt Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3023    Accepted Submission(s): 1155Problem DescriptionIn a two-dimensiona

Bloxorz ITime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5275 Accepted: 1767DescriptionLittle Tom loves playing games. One day he downloads a little com

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5288题意：给出一个序列，计算所有满足：存在ai使的区间内不存在ai的倍数的区间个数和分析：从ai先两端找到不是ai倍数的两个端点了，li，ri。sum(i)=(loc(ai)-li)*(ri-loc(ai));#include#include#include#include

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5249分析：这道题是2015百度之星初赛1的4题这道题不算太难当时队友做出来了，不过费了老大劲，其实我从中能够吸取教训的，原因是，我一看这道题就是数据结构的，然后和队友想的一样二分查找，但是从中遇到了一系列的问题：首先储存数据我们不能用带有下标的数组，因为题目中的数据是可删可添的这样

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5246分析：题意就不用说了，这道题是2015百度之星初赛1的第一题，一看就是一道贪心题，关键是如何想出谈心策略，其实要想通两点：1>百小度的战斗力只升不要降，最坏也就是不升2>百小度的潜能值随时间推移逐渐减小想到这两点我们就可以想到贪心策略：我们要尽快的使百小度潜能激发出来，以为

题目链接：http://poj.org/problem?id=1509题意：题目情节说了一顿，一看就是最小表示法啊，就是给你一个字符串环，找出第i位置使字符串以此为起点是的字典序最小，模板题。献上代码：#include#include#include#includeusing namespace std;const int maxn=20000+10;cha

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5247分析：这道题是2015百度之星初赛1的2题，当时没看这道题是队友看的，比完以后也做了一下，思路大体都是一样的，就是暴力枚举，因为k这段区间，把每得到一段连续的子区间[x，?]，则num[len]++(len=size([x,?]));这样就可以了，最后num数组里就是对应的答案

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1688题意：求最短路和次短路条数如果次短路长度=最短路长度+1这输出次短路条数+最短路条数，否则输出最短路条数分析：这是到模版题，献上模版：#include#include#include#include#include#includeusing namespace st

题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=1107#include#include#include#includeusing namespace std;const int maxn=2000+10;typedef struct Node{ int x,y; int level,in,out,lift;//门

题目连接：http://acm.hdu.edu.cn/showproblem.php?pid=5234题意：给出一个n*m的矩阵和一个整数k，要求从左上角开始只能往右或者往左开始遍历，在途中可以选择加当前位置的数或者不加当前位置的数，求最终加的数的和小于k的最大值。分析：这道题一看就是一般的背包，但是没研究过背包和dp，只是凭这感觉写了状态转移方程，wa了几次A了，感觉dp是个

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4768题意：学校有N个社团，新学期开始之际这N个社团发传单，它们发传单是有规律的，有三个数组A[maxn]，B[maxn]，C[maxn]，第i个设团值发给编号为x的同学，其中x=A[i]+k*C[i]且k为整数，x小于等于B[i];学校学生标号1~2^31,求那个同学收到传单数为奇数和

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3870这道题是一道裸的求割问题也即求最大流，但是使用一般网络流这道题会超时，这是这道题的难点，但是鉴于这道题的图的特殊性，可以用最大最小定理来求割，这边是这道题的考察点。推荐诸君看一下最大最小个定理，推荐链接：http://www.doc88.com/p-386772667290.h

拓扑排序模版题#include#include#include#include#includeusing namespace std;const int maxe=250000+10;const int maxh=500+10;typedef struct Edge{    int to,next;};Edge E[maxe];int hea

True LiarsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2221 Accepted: 685DescriptionAfter having drifted about in a small boat for a couple of days,

RochambeauTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2092 Accepted: 733DescriptionN children are playing Rochambeau (scissors-rock-cloth) game wi

PseudoforestTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1929    Accepted Submission(s): 745Problem DescriptionIn graph theory,

Isabella's MessageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2098    Accepted Submission(s): 614Problem DescriptionIsabella and

食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 49310 Accepted: 14382Description动物王国中有三类动物A,B,C，这三类动物的食物链构成了有趣的环形。A吃B， B吃C，C吃A。 现有N个动物，以1－N编号。每个动物都

Minimal Ratio TreeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2849    Accepted Submission(s): 849Problem DescriptionFor a tree,

Sudoku KillerTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4161    Accepted Submission(s): 1308Problem Description自从2006年3月10日至11日