10 2015 档案

POJ3468（线段树区间增加，区间求和）
摘要：A Simple Problem with IntegersTime Limit:5000MSMemory Limit:131072KTotal Submissions:81519Accepted:25185Case Time Limit:2000MSDescriptionYou haveNinte... 阅读全文
posted @ 2015-10-31 23:51 LinKArftc 阅读(195) 评论(0) 推荐(0)
POJ3264（线段树求区间最大最小值）
摘要：Balanced LineupTime Limit:5000MSMemory Limit:65536KTotal Submissions:41162Accepted:19327Case Time Limit:2000MSDescriptionFor the daily milking, Farmer... 阅读全文
posted @ 2015-10-31 18:31 LinKArftc 阅读(228) 评论(0) 推荐(0)
HDU1174（空间点到直线的距离，用叉积）
摘要：爆头Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2002Accepted Submission(s): 868Problem Descripti... 阅读全文
posted @ 2015-10-31 18:17 LinKArftc 阅读(569) 评论(0) 推荐(0)
2-SAT问题及其算法
摘要：[转]http://www.cppblog.com/MatoNo1/archive/2011/07/13/150766.aspx【2-SAT问题】现有一个由N个布尔值组成的序列A，给出一些限制关系，比如A[x]AND A[y]=0、A[x]OR A[y]OR A[z]=1等，要确定A[0..N-1]... 阅读全文
posted @ 2015-10-28 21:16 LinKArftc 阅读(308) 评论(0) 推荐(0)
HDU1907（尼姆博弈）
摘要：JohnTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 3762Accepted Submission(s): 2127Problem Descri... 阅读全文
posted @ 2015-10-28 10:33 LinKArftc 阅读(193) 评论(0) 推荐(0)
HDU3910（数学期望题，题目难懂）
摘要：Liang Guo ShaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 590Accepted Submission(s): 426Problem... 阅读全文
posted @ 2015-10-26 20:21 LinKArftc 阅读(211) 评论(0) 推荐(0)
HDU2389（二分图匹配Hopcroft-Carp算法）
摘要：Rain on your ParadeTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 655350/165535 K (Java/Others)Total Submission(s): 3310Accepted Submission(s): 1... 阅读全文
posted @ 2015-10-26 19:31 LinKArftc 阅读(824) 评论(0) 推荐(0)
二分图详解
摘要：本着“勿在浮沙筑高台”的原则，在这里总结一下二分图的各类知识和模板，彻底搞懂二分图一、相关概念和性质一些简单的概念这里就一带而过了。极大和最大的区别：极大指的是再加入任意点或边将不再满足条件，最大指的是极大中点或边最多的集合1、点覆盖、最小点覆盖2、边覆盖、极小边覆盖3、独立集、极大独立集独立集即一... 阅读全文
posted @ 2015-10-26 18:59 LinKArftc 阅读(577) 评论(0) 推荐(0)
巴什博弈、威佐夫博弈、尼姆博弈
摘要：取石子问题 [转]ACM取石子游戏有一种很有意思的游戏，就是有物体若干堆，可以是火柴棍或是围棋子等等均可。两个人轮流从堆中取物体若干，规定最后取光物体者取胜。这是我国民间很古老的一个游戏，别看这游戏极其简单，却蕴含着深刻的数学原理。下面我们来分析一下要如何才能够取胜。（一）巴什博奕（Bash Gam... 阅读全文
posted @ 2015-10-25 22:37 LinKArftc 阅读(696) 评论(0) 推荐(0)
HDU2819（二分图匹配，记录过程）
摘要：SwapTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2236Accepted Submission(s): 801Special JudgePr... 阅读全文
posted @ 2015-10-25 16:34 LinKArftc 阅读(237) 评论(0) 推荐(0)
HDU1281（二分图最大匹配，棋盘建图，找关键点）
摘要：棋盘游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3328Accepted Submission(s): 1965Problem Descri... 阅读全文
posted @ 2015-10-25 11:43 LinKArftc 阅读(257) 评论(0) 推荐(0)
HDU1083（二分图最大匹配vector实现）
摘要：CoursesTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5153Accepted Submission(s): 2477Problem D... 阅读全文
posted @ 2015-10-25 10:39 LinKArftc 阅读(247) 评论(0) 推荐(0)
HDU2444（判断是否为二分图，求最大匹配）
摘要：The Accomodation of StudentsTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3836Accepted Submissio... 阅读全文
posted @ 2015-10-25 10:25 LinKArftc 阅读(178) 评论(0) 推荐(0)
HDU1166（线段树单点更新区间查询）
摘要：敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 62483Accepted Submission(s): 26386Problem Desc... 阅读全文
posted @ 2015-10-24 22:17 LinKArftc 阅读(189) 评论(0) 推荐(0)
HDU1045（二分图经典建模）
摘要：Fire NetTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8338Accepted Submission(s): 4796Problem De... 阅读全文
posted @ 2015-10-24 21:31 LinKArftc 阅读(294) 评论(0) 推荐(0)
POJ1220（大数进制转换）
摘要：NUMBER BASE CONVERSIONTime Limit:1000MSMemory Limit:10000KTotal Submissions:4652Accepted:2132DescriptionWrite a program to convert numbers in one base... 阅读全文
posted @ 2015-10-24 20:57 LinKArftc 阅读(256) 评论(0) 推荐(0)
POJ3466（01背包变形）
摘要：Proud MerchantsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 3805Accepted Submission(s): 1587Pr... 阅读全文
posted @ 2015-10-24 19:41 LinKArftc 阅读(178) 评论(0) 推荐(0)
POJ3180（有向图强连通分量结点数>=2的个数）
摘要：The Cow PromTime Limit:1000MSMemory Limit:65536KTotal Submissions:1451Accepted:922DescriptionThe N (2 =2的个数。虽然简单，但是第一次确敲错了好几个小地方，敲代码时一定要专心，下面列出错误/*ID:... 阅读全文
posted @ 2015-10-24 18:46 LinKArftc 阅读(198) 评论(0) 推荐(0)
POJ1236 （强连通分量缩点求入度为0和出度为0的分量个数）
摘要：Network of SchoolsTime Limit:1000MSMemory Limit:10000KTotal Submissions:13804Accepted:5507DescriptionA number of schools are connected to a computer n... 阅读全文
posted @ 2015-10-24 00:26 LinKArftc 阅读(235) 评论(0) 推荐(0)
POJ2186 （强连通分量缩点后出度为0的分量内点个数）
摘要：Popular CowsTime Limit:2000MSMemory Limit:65536KTotal Submissions:27820Accepted:11208DescriptionEvery cow's dream is to become the most popular cow in... 阅读全文
posted @ 2015-10-23 22:58 LinKArftc 阅读(160) 评论(0) 推荐(0)
POJ1258 （最小生成树prim）
摘要：Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:46319Accepted:19052DescriptionFarmer John has been elected mayor of his town! One of his... 阅读全文
posted @ 2015-10-23 21:03 LinKArftc 阅读(187) 评论(0) 推荐(0)
HDU1248 （完全背包简单变形）
摘要：寒冰王座Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13532Accepted Submission(s): 6876Problem Descr... 阅读全文
posted @ 2015-10-23 17:23 LinKArftc 阅读(250) 评论(0) 推荐(0)
HDU1142 （Dijkstra+记忆化搜索）
摘要：A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6935Accepted Submission(s... 阅读全文
posted @ 2015-10-23 15:33 LinKArftc 阅读(765) 评论(0) 推荐(0)
HDU1217 （Floyd简单变形）
摘要：ArbitrageTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5794Accepted Submission(s): 2683Problem D... 阅读全文
posted @ 2015-10-23 14:39 LinKArftc 阅读(183) 评论(0) 推荐(0)
HDU1028 （整数拆分）
摘要：Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16191Accepted Submiss... 阅读全文
posted @ 2015-10-23 12:00 LinKArftc 阅读(203) 评论(0) 推荐(0)
HDU1016 Prime Ring Problem
摘要：Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 35961Accepted Submission(s): 158... 阅读全文
posted @ 2015-10-22 23:56 LinKArftc 阅读(173) 评论(0) 推荐(0)
待做的题
摘要：HDU3668 VolumePOJ1753 Flip GamePOJ2965The Pilots Brothers' refrigerator母函数http://blog.csdn.net/vsooda/article/details/7975485HDU1172 猜数字 阅读全文
posted @ 2015-10-22 23:35 LinKArftc 阅读(126) 评论(0) 推荐(0)
HDU3664 Permutation Counting
摘要：Permutation CountingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1487Accepted Submission(s): 75... 阅读全文
posted @ 2015-10-22 23:06 LinKArftc 阅读(214) 评论(0) 推荐(0)
HDU1010（dfs+剪枝）
摘要：Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 92693Accepted Submission(s): 25... 阅读全文
posted @ 2015-10-22 21:44 LinKArftc 阅读(164) 评论(0) 推荐(0)
HDU1068 （二分图最大匹配匈牙利算法）
摘要：Girls and BoysTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9100Accepted Submission(s): 4185Pr... 阅读全文
posted @ 2015-10-22 20:47 LinKArftc 阅读(510) 评论(0) 推荐(0)
HDU1385 （Floyd记录路径）
摘要：Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9052Accepted Submission(s): ... 阅读全文
posted @ 2015-10-22 20:33 LinKArftc 阅读(228) 评论(0) 推荐(0)
ZOJ1003 Crashing Balloon
摘要：Crashing BalloonTime Limit:2 Seconds Memory Limit:65536 KBOn every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. ... 阅读全文
posted @ 2015-10-22 20:25 LinKArftc 阅读(237) 评论(0) 推荐(0)
错排
摘要：考虑一个有n个元素的排列，若一个排列中所有的元素都不在自己原来的位置上，那么这样的排列就称为原排列的一个错排。 n个元素的错排数记为D(n)典型问题如在写信时将n封信装到n个不同的信封里，有多少种全部装错信封的情况？又比如四人各写一张贺年卡互相赠送，有多少种赠送方法？自己写的贺年卡不能送给自己。等等... 阅读全文
posted @ 2015-10-22 20:20 LinKArftc 阅读(249) 评论(0) 推荐(0)
HDU1284 钱币兑换问题
摘要：钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7909Accepted Submission(s): 4704Problem Desc... 阅读全文
posted @ 2015-10-22 20:14 LinKArftc 阅读(234) 评论(0) 推荐(0)
HDU2441 ACM(Array Complicated Manipulation)
摘要：ACM(Array Complicated Manipulation)Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 513Accepted Sub... 阅读全文
posted @ 2015-10-22 20:09 LinKArftc 阅读(243) 评论(0) 推荐(0)
HDU1018 （斯特林公式）
摘要：Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 31681Accepted Submission(s): 14769Proble... 阅读全文
posted @ 2015-10-22 19:58 LinKArftc 阅读(211) 评论(0) 推荐(0)
盒子放球
摘要：盒子放球问题第一类：将k个球放入n个不同的盒子中，每个盒子放球数>=0，求方法数假设n个盒子分别放x1,x2,x3...xn，则x1+x2+x3+...+xn=k，令yi=xi+1(1=1且y1+y2+...+yn=n+k，相当于求yi这个方程的解组数，可以看成插板问题，往n+k个物品中插入n-1个... 阅读全文
posted @ 2015-10-22 19:48 LinKArftc 阅读(388) 评论(0) 推荐(0)
POJ2245 Lotto
摘要：LottoTime Limit:1000MSMemory Limit:65536KTotal Submissions:6634Accepted:4201DescriptionIn the German Lotto you have to select 6 numbers from the set {... 阅读全文
posted @ 2015-10-22 19:35 LinKArftc 阅读(224) 评论(0) 推荐(0)
C++高精度
摘要：整理了一下高精度，虽然可用java，但很多时候还是C++写的方便。附上kuangbin神的高精度模板（HDU1134 求卡特兰数）#include #include #include #include using namespace std;/* * 完全大数模板 * 输出cin>>a * 输出a.... 阅读全文
posted @ 2015-10-22 19:28 LinKArftc 阅读(454) 评论(0) 推荐(0)
POJ1019 Number Sequence
摘要：Number SequenceTime Limit:1000MSMemory Limit:10000KTotal Submissions:36256Accepted:10461DescriptionA single positive integer i is given. Write a progr... 阅读全文
posted @ 2015-10-22 19:19 LinKArftc 阅读(206) 评论(0) 推荐(0)
2015长春区域赛感想
摘要：ACM生涯第一块牌子，虽然很开心，但老实说，还是有那么点遗憾的。扫一眼铜牌区，我们是最突出的，大家都过的J题我们没过，过了就是银牌。这次比赛最大的感触就是自己基础不扎实，所以发挥不稳定。 所以我打算从基础抓起，把之前刷过的题目都再看一遍，必要的再刷一遍，遇到好的题目及时总结，所以注册了这个博客... 阅读全文
posted @ 2015-10-22 19:10 LinKArftc 阅读(209) 评论(0) 推荐(0)