HDU 4751 Divide Groups 2013 ACM/ICPC Asia Regional Nanjing Online
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4751题目大意：判断一堆人能否分成两组，组内人都互相认识。解题思路：如果两个人不是相互认识，该两人之间连边。最终构成一张图，二分匹配。 #include<cstdio> #include<...
hdu4811-Ball(2013ACM/ICPC亚洲区南京站现场赛)
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4811题目描述：Problem DescriptionJenny likes balls. He has some balls and he wants to arrange them in a row ...
训练报告 (2014-2015) 2014, Samara SAU ACM ICPC Quarterfinal Qualification Contest
SolvedAGym 100488AYet Another Goat in the Garden BGym 100488BImpossible to GuessSolvedCGym 100488CLost TempleSolvedDGym 100488DToy SoldiersSolvedEGym ...
ACM/ICPC 之 伞兵-最小割转最大流(POJ3308)
//以行列建点，伞兵位置为单向边-利用对数将乘积转加法//最小割转最大流//Time:63Ms Memory:792K#include<iostream>#include<cstring>#include<cstdio>#include<cmath>#...
【2016 ACM/ICPC Asia Regional Qingdao Online】
[ HDU 5878 ] I Count Two Three考虑极端，1e9就是2的30次方，3的17次方，5的12次方，7的10次方。而且，不超过1e9的乘积不过5000多个，于是预处理出来，然后每次二分找就可以了。 /* TASK:I Count Two Three 2^a*3^b*5^c*7^...
2014 ACM/ICPC Asia Regional Anshan Online
默默的签到Osu! http://acm.hdu.edu.cn/showproblem.php?pid=5003 #include<cstdio> #include<algorithm> using namespace std; int a[]; int main(){ ...
HDU 5029 Relief grain（离线+线段树+启发式合并）（2014 ACM/ICPC Asia Regional Guangzhou Online）
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5029Problem DescriptionThe soil is cracking up because of the drought and the rabbit kingdom is facing ...
2014 ACM/ICPC Asia Regional Xi'an Online
03 hdu5009状态转移方程很好想，dp[i] = min(dp[j]+o[j~i]^2,dp[i]) ,o[j~i]表示从j到i颜色的种数。普通的O（n*n）是会超时的，可以想到o[]最大为sqrt(n),问题是怎么快速找到从i开始往前2种颜色、三种、四种。。。o[]种的位置。离散化之后，可以...
2014 ACM/ICPC Asia Regional 北京 Online
G - GradeTed is a employee of Always Cook Mushroom (ACM). His boss Matt gives him a pack of mushrooms and ask him to grade each mushroom according to ...
2014 ACM/ICPC Asia Regional Shanghai Online
Tree http://acm.hdu.edu.cn/showproblem.php?pid=5044树链剖分，区间更新的时候要用on的左++右--的标记方法，要手动扩栈，用c++交，综合以上的条件可过。 #include<cstdio> #include<cstring> ...
hdu 5016 点分治(2014 ACM/ICPC Asia Regional Xi'an Online)
Mart Master IITime Limit: 12000/6000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 675 Accepted Submission(s): ...
2014 ACM/ICPC Asia Regional Guangzhou Online
Wang Xifeng's Little Plot http://acm.hdu.edu.cn/showproblem.php?pid=5024预处理出每个点八个方向能走的最远距离，然后枚举起点，枚举方向，每走一步都要枚举左转和右转的情况，因为预处理好了，所以可以直接算出来。 #include<...
HDU 5000 2014 ACM/ICPC Asia Regional Anshan Online DP
CloneTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/65536K (Java/Other)Total Submission(s) : 8 Accepted Submission(s) : 5Font: Times N...
icpc 南昌邀请赛网络赛 Subsequence
题目链接：https://nanti.jisuanke.com/t/38232就是判断输入是不是子序列 没想到贡献了将近十几次罚时..........可以说是菜的真实了用cin cout超时了 改了scanf printf才过#include<bits/stdc++.h>using na...
2018ICPC青岛 E - Plants vs. Zombies (二分+模拟)
ZOJ - 4062题意：有n个植物排成一排，按顺序植物的编号是1-n，每个植物都有一个生长速率，有一个机器人，机器人可以走m步,每走一步，这个机器人就会浇一次水，浇一次水那个植物就会长自身的生长速率那么高，然后现在要求最大的最小生长值，思路：一般要求最大的最小值都是使用二分来求答案，我们二分出的答...
2017ICPC南宁 M题 The Maximum Unreachable Node Set【二分图】
题意：找出不能相互访问的点集的集合的元素数量。思路：偏序集最长反链裸题。代码：#include<iostream>#include<cstring>using namespace std;const int maxn=;int g[maxn][maxn];int uN,vN;...
2015-2016 ACM-ICPC, NEERC, Moscow Subregional Contest J - Jealousy
题意:有n张照片,每张照片上有一些妹子,要按照片顺序给妹纸安排男朋友,如果妹纸i安排的男朋友之前有女朋友,那么费用+wi,求总费用最小,和输出路径题解:费用流,先把照片天数建点i连i+1,流量k(最多的男朋友数量),费用0,再把所有按照片顺序出现的妹纸拆点,自己流自己,流量1,费用-inf(保证要安...
HDU 5950 - Recursive sequence - [矩阵快速幂加速递推][2016ACM/ICPC亚洲区沈阳站 Problem C]
题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5950Farmer John likes to play mathematics games with his N cows. Recently, they are attracted by recurs...
2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest A Email Aliases（模拟STL vector+map）
Email AliasesCrawling in process... Crawling failed Time Limit:2000MS Memory Limit:524288KB 64bit IO Format:%I64d & %I64uSubmit StatusDesc...
2015ACM/ICPC亚洲区沈阳站 B-Bazinga
BazingaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3509 Accepted Submission(s): 1122Pro...