07 2012 档案
摘要:还是畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14115Accepted Submission(s): 6435Problem Des...
        阅读全文
                
摘要:最小生成树两个重要的算法:Prim 和 Kruskal。Prim:时间复杂度O(n^2),适用于边稠密的网络。Kruskal:时间复杂度为O(e*log(e)),适用于边稀疏的网络。【Prim主要算法思想和函数】注:扩展了部分功能,根据需要可以选择得到算法结束时哪些边被选择。 1 #include ...
        阅读全文
                
摘要:这三个算法每本算法书都要讲到,这次看《算法之道》又复习了一遍,觉得有些新的领悟,写个模板记录一下。Kruskal和Prim算法解决的问题都是最小生成树问题,即对于一个图G,找到它的最小生成树T,其中E’包含于E,使得所有V都连通。Dijkstra算法解决的是单源多点最短路径问题,即对于一个图G和一个...
        阅读全文
                
摘要:畅通工程Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16564Accepted Submission(s): 8540Problem Descr...
        阅读全文
                
摘要:How Many TablesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6049Accepted Submission(s): 2874Pro...
        阅读全文
                
摘要:[转]高级数据结构设计--并查集及实现学习笔记(有趣篇)2012年02月22日 ⁄ 算法 ⁄ 评论数 1⁄ 被围观 416+ (1 votes, average: 5.00 out of 5)Loading ...高级数据结构设计--并查集及实现学习笔记(有趣篇)并查集的程序设计:为了解释并查集的原...
        阅读全文
                
摘要:1《代码大全》2《程序员修炼之道》3《计算机程序的构造和解释》4《C程序设计语言》5《算法导论》6《重构:改善既有代码的设计》7《人月神话》8《设计模式》9《计算机程序设计艺术 (第一卷)》10《编译原理》
        阅读全文
                
摘要:A strange liftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6056Accepted Submission(s): 2238Prob...
        阅读全文
                
摘要:WoodenSticksTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 145, Accepted users: 127Problem 10814 : No special ...
        阅读全文
                
摘要:find the nth digitTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5514Accepted Submission(s): 1557...
        阅读全文
                
摘要:Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15969Accepted Submission(s): 7061Problem...
        阅读全文
                
摘要:MatchsticksTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KBTotal submit users: 174, Accepted users: 142Problem 11525 : No special j...
        阅读全文
                
摘要:RobotsonagridTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65535KBTotal submit users: 30, Accepted users: 24Problem 12363 : No special j...
        阅读全文
                
摘要:最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8963Accepted Submission(s): 3476Problem Desc...
        阅读全文
                
摘要:I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9134Accepted Submission(s): 3341Pro...
        阅读全文
                
摘要:转自:http://blog.csdn.net/tukangzheng/article/details/6952244#Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Othe...
        阅读全文
                
摘要:AKnightandaQueenTime Limit: 5000ms, Special Time Limit:12500ms, Memory Limit:32768KBTotal submit users: 52, Accepted users: 42Problem 11491 : No speci...
        阅读全文
                
摘要:简易版之最短距离Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6526Accepted Submission(s): 2885Problem De...
        阅读全文
                
摘要:Piggy-BankTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5078Accepted Submission(s): 2505Problem ...
        阅读全文
                
摘要:非修改性序列操作(12个)循环对序列中的每个元素执行某操作for_each()查找在序列中找出某个值的第一次出现的位置find()在序列中找出符合某谓词的第一个元素find_if()在序列中找出一子序列的最后一次出现的位置find_end()在序列中找出第一次出现指定值集中之值的位置find_fir...
        阅读全文
                
摘要:C++标准库C++标准库的所有头文件都没有扩展名。C++标准库的内容总共在50个标准头文件中定义,其中18个提供了C库的功能。 形式的标准头文件【 例外】其内容与ISO标准C包含的name.h头文件相同,但容纳了C++扩展的功能。在 形式标准的头文件中,与宏相关的名称在全局作用域中定义,其他名称在s...
        阅读全文
                
摘要:用sort函数对int型的数组进行排序:【升序】方法一: 1 #include 2 #include 3 using namespace std; 4 int main() 5 { 6 int data[100]; 7 int n; 8 int i; 9 while...
        阅读全文
                
摘要:EquidivisionsTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 34, Accepted users: 28Problem 10641 : No special j...
        阅读全文
                
摘要:搬寝室Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8907Accepted Submission(s): 2996Problem Descrip...
        阅读全文
                
摘要:1086: 超市购物Time Limit: 1 SecMemory Limit: 128 MBSUBMIT: 153Solved: 64[SUBMIT][STATUS]Description 上次去超市扫荡回来的东西用完了,Staginner又得跑超市一趟,出发前他列了一张购物清单,打算去买K...
        阅读全文
                
摘要:1090: Number TransformationTime Limit: 1 SecMemory Limit: 128 MBSUBMIT: 387Solved: 47[SUBMIT][STATUS]DescriptionIn this problem, you are given a pair ...
        阅读全文
                
摘要:http://blog.sina.com.cn/s/blog_69c62b650100y53r.html#includeusing namespace std;const int MAXV = 10000; //素数表范围bool flag[MAXV+1]; //标志一个数是否为素数int prim...
        阅读全文
                
摘要:Buy the TicketTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2400Accepted Submission(s): 1028Prob...
        阅读全文
                
摘要:1.任取黑白混杂的棋子21个,排成3行7列,证明无论怎样排列,都可以找到一个小长方形矩阵,使四个角上的棋子的颜色相同。三行七列,每一列至少有两个颜色相同,六种情况:12同白,12同黑,13同白,13同黑,23同白,23同黑。六种情况、七列,必然有至少两列情况相同,故得到解,鸽笼原理,记得小时候书上管...
        阅读全文
                
摘要:位图Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal submit users: 230, Accepted users: 201Problem 10109 : No special judgementP...
        阅读全文
                
摘要:http://acm.hnu.cn/online/?action=problem&type=show&id=10513AllocationSchemeTime Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KBTotal su...
        阅读全文
                
摘要:题目地址:http://acm.hnu.cn/online/?action=problem&type=show&id=12312&courseid=215IncredibleTime Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:655...
        阅读全文
                
摘要:转自:http://972169909-qq-com.iteye.com/blog/1043902Washing ClothesTime Limit: 1000MSMemory Limit: 131072KTotal Submissions: 7063Accepted: 2089Descriptio...
        阅读全文
                
摘要:1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include ...
        阅读全文
                
摘要:Charm BraceletTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 12564Accepted: 5745DescriptionBessie has gone to the mall's jewelry store and s...
        阅读全文
                
摘要:大菲波数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6385Accepted Submission(s): 2083Problem Descri...
        阅读全文
                
摘要:Children’s QueueTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6000Accepted Submission(s): 1887Pr...
        阅读全文
                
摘要:EncodingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16210Accepted Submission(s): 6906Problem D...
        阅读全文
                
摘要:转自:http://blog.csdn.net/kay_sprint/article/details/7237521RobberiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Tota...
        阅读全文
                
摘要:Bone CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12502Accepted Submission(s): 4874Pro...
        阅读全文
                
摘要:转自:http://blog.csdn.net/kay_sprint/article/details/7237608#cpp最大报销额Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Tota...
        阅读全文
                
摘要:转载自 sunstar1989最终编辑 中华复生母动态规划是用空间换时间的一种方法的抽象。其关键是发现子问题和记录其结果。然后利用这些结果减轻运算量。比如01背包问题。因为背包最大容量M未知。所以,我们的程序要从1到M一个一个的试。比如,开始任选N件物品的一个。看对应M的背包,能不能放进去,如果能放...
        阅读全文
                
摘要:免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13555Accepted Submission(s): 4485Problem Descr...
        阅读全文
                
摘要:N!Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32942Accepted Submission(s): 9106Problem Descri...
        阅读全文
                
摘要:最大连续子序列Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11260Accepted Submission(s): 4745Problem De...
        阅读全文
                
摘要:最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8593Accepted Submission(s): 3332Problem Desc...
        阅读全文
                
摘要:数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10651Accepted Submission(s): 6386Problem Descrip...
        阅读全文
                
摘要:N皇后问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3072Accepted Submission(s): 1419Problem Descr...
        阅读全文
                
摘要:哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 390Accepted Submission(s): 241Problem Des...
        阅读全文
                
摘要:下沙小面的(2)Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 9Accepted Submission(s) : 4Font:Times New R...
        阅读全文
                
摘要:Sum It UpTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1820Accepted Submission(s): 911Problem De...
        阅读全文
                
摘要:Robot MotionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3528Accepted Submission(s): 1644Proble...
        阅读全文
                
                    
                
浙公网安备 33010602011771号