11 2012 档案

hdu 3829 Cat VS Dog 【二分图求最大独立集】
摘要：原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=3829题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=17572#problem/E（CSUST图论训练赛）二分匹配，求最大独立集。Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1870Accepted Submission(s): 633Probl 阅读全文
posted @ 2012-11-28 18:24 free斩 阅读(216) 评论(0) 推荐(0)
hdu 3829 Cat VS Dog (二分图求最大独立集)
摘要：原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=3829题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=17572#problem/E（CSUST图论训练赛）二分匹配，求最大独立集。Cat VS DogTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1870Accepted Submission(s): 633Probl 阅读全文
posted @ 2012-11-28 18:24 free斩 阅读(202) 评论(0) 推荐(0)
POJ 3041 Asteroids (匈牙利算法最小点覆盖)
摘要：原题链接：http://poj.org/problem?id=3041题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法：匈牙利算法（二分匹配，求最小点覆盖数）AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field 阅读全文
posted @ 2012-11-23 01:13 free斩 阅读(597) 评论(0) 推荐(0)
POJ 3041 Asteroids 【匈牙利算法最小点覆盖】
摘要：原题链接：http://poj.org/problem?id=3041题目来源：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16967#problem/E算法：匈牙利算法（二分匹配，求最小点覆盖数）AsteroidsTime Limit:1000MSMemory Limit:65536KTotal Submissions:10768Accepted:5823DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field 阅读全文
posted @ 2012-11-23 01:13 free斩 阅读(255) 评论(0) 推荐(0)
POJ 1469 COURSES【匈牙利算法入门 二分图的最大匹配 模板题】
摘要：题目链接：http://poj.org/problem?id=1469COURSESTime Limit:1000MSMemory Limit:10000KTotal Submissions:14455Accepted:5715DescriptionConsider a group of N students and P courses. Each student visits zero, one or more than one courses. Your task is to determine whether it is possible to form a committee of e 阅读全文
posted @ 2012-11-22 15:11 free斩 阅读(212) 评论(0) 推荐(0)
二分图最大匹配总结【转自kb神】
摘要：转载来源：http://www.cnblogs.com/kuangbin/archive/2012/08/26/2657446.html无限膜拜kb神啊！！！二分图匹配（匈牙利算法）1。一个二分图中的最大匹配数等于这个图中的最小点覆盖数König定理是一个二分图中很重要的定理，它的意思是，一个二分图中的最大匹配数等于这个图中的最小点覆盖数。如果你还不知道什么是最小点覆盖，我也在这里说一下：假如选了一个点就相当于覆盖了以它为端点的所有边，你需要选择最少的点来覆盖所有的边。2。最小路径覆盖=最小路径覆盖＝｜G｜－最大匹配数在一个N*N的有向图中，路径覆盖就是在图中找一些路经，使之覆盖了图 阅读全文
posted @ 2012-11-20 22:59 free斩 阅读(174) 评论(0) 推荐(0)
POJ 1094 && ZOJ 1060 Sorting It All Out 【拓扑排序入门】
摘要：原题链接：http://poj.org/problem?id=1094同ZOJ 1060：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1060Sorting It All OutTime Limit:1000MSMemory Limit:10000KTotal Submissions:21983Accepted:7574DescriptionAnascending sorted sequence of distinct values is one in which some form of aless-than op 阅读全文
posted @ 2012-11-20 20:06 free斩 阅读(216) 评论(0) 推荐(0)
acm入门
摘要：初期:一.基本算法:(1)枚举.(poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)构造法.(poj3295)(6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:(1)图的深度优先遍历和广度优先遍历.(2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)(3)最小生成树算法(prim,kruskal)(poj178 阅读全文
posted @ 2012-11-16 02:56 free斩 阅读(663) 评论(0) 推荐(1)
[置顶] acm入门
摘要：初期:一.基本算法:(1)枚举.(poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)构造法.(poj3295)(6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:(1)图的深度优先遍历和广度优先遍历.(2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)(3)最小生成树算法(prim,kruskal)(poj178 阅读全文
posted @ 2012-11-16 02:56 free斩 阅读(244) 评论(0) 推荐(0)
【转】acm入门
摘要：初期:一.基本算法:(1)枚举.(poj1753,poj2965)(2)贪心(poj1328,poj2109,poj2586)(3)递归和分治法.(4)递推.(5)构造法.(poj3295)(6)模拟法.(poj1068,poj2632,poj1573,poj2993,poj2996)二.图算法:(1)图的深度优先遍历和广度优先遍历.(2)最短路径算法(dijkstra,bellman-ford,floyd,heap+dijkstra)(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)(3)最小生成树算法(prim,kruskal)(poj178 阅读全文
posted @ 2012-11-16 02:56 free斩 阅读(353) 评论(0) 推荐(0)
POJ 1258 Agri-Net （最小生成树入门题目）
摘要：原题链接：http://poj.org/problem?id=1258周四上了节数据结构终于知道何为最小生成树，晚上回寝，遂得此题！Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:29613Accepted:11750Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He 阅读全文
posted @ 2012-11-16 02:49 free斩 阅读(213) 评论(0) 推荐(0)
POJ 1258 Agri-Net 【最小生成树入门题目】
摘要：原题链接：http://poj.org/problem?id=1258周四上了节数据结构终于知道何为最小生成树，晚上回寝，遂得此题！Agri-NetTime Limit:1000MSMemory Limit:10000KTotal Submissions:29613Accepted:11750DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He n 阅读全文
posted @ 2012-11-16 02:49 free斩 阅读(194) 评论(0) 推荐(0)
用筛法求之N内的素数。(N < 1000000)
摘要：来源:http://my.oschina.net/dianpaopao/blog/83844#include<stdio.h> #include<stdlib.h> #define NMAX 10000000 #define SQRN 10000 int main() { int n; scanf("%d",&n); static char a[NMAX]; unsigned long k,i; for(k=2;k<=SQRN;k++) if(!a[k]) for(i=2*k;i<n;i+=k) a[i... 阅读全文
posted @ 2012-11-13 11:14 free斩 阅读(359) 评论(0) 推荐(0)
【转】用筛法求之N内的素数。(N < 1000000)
摘要：来源:http://my.oschina.net/dianpaopao/blog/83844#include<stdio.h>#include<stdlib.h>#define NMAX 10000000#define SQRN 10000int main(){ int n; scanf("%d",&n); static char a[NMAX]; unsigned long k,i; for(k=2;k<=SQRN;k++) if(!a[k]) for(i=2*k;i<n;i+=k) a[i]=1;... 阅读全文
posted @ 2012-11-13 11:14 free斩 阅读(311) 评论(0) 推荐(0)
uva 11437 Triangle Fun
摘要：原题链接：我的来源：2012.11.11CSUST Warm Up(Preparing for the 2013 )(personal)：http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=16690#problem/II -Triangle FunTime Limit:1000MSMemory Limit:0KB64bit IO Format:%lld & %lluSubmitStatusDescriptionIn the picture below you can see a triangle ABC. Point D 阅读全文
posted @ 2012-11-11 21:39 free斩 阅读(739) 评论(0) 推荐(0)
POJ 3278 Catch That Cow （bfs+队列）
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(219) 评论(0) 推荐(0)
POJ 3278 Catch That Cow 【bfs+队列】
摘要：原题链接：http://poj.org/problem?id=3278算法：bfs+队列+STL（C++）PS：bfs入门题目，好高兴啊，终于会用bfs了。Catch That CowTime Limit:2000MSMemory Limit:65536KTotal Submissions:32679Accepted:10060DescriptionFarmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a pointN(0 阅读全文
posted @ 2012-11-10 00:52 free斩 阅读(215) 评论(0) 推荐(0)
POJ 1753 Flip Game（翻转棋盘+枚举+dfs）
摘要：方法：一、枚举（此处所用） 二、用二进制记录下标（尚未实现） 三、类比于玩魔方游戏（思路来自黄超，尚未实现）原题链接：http://poj.org/problem?id=1753Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:21024Accepted:9108DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side ... 阅读全文
posted @ 2012-11-02 19:35 free斩 阅读(596) 评论(0) 推荐(0)
POJ 1753 Flip Game【翻转棋盘+枚举+dfs】
摘要：方法：一、枚举（此处所用） 二、用二进制记录下标（尚未实现） 三、类比于玩魔方游戏（思路来自黄超，尚未实现）原题链接：http://poj.org/problem?id=1753Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:21024Accepted:9108DescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side ... 阅读全文
posted @ 2012-11-02 19:35 free斩 阅读(261) 评论(0) 推荐(0)