![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
文章平均质量分 81
xiaotaoqibao
这个作者很懒,什么都没留下…
展开
-
HDU 1068(图论,二分匹配)
Girls and Boys<br />Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 2105 Accepted Submission(s): 915<br /><br />Problem Descriptionthe second year of the university somebody started a study原创 2010-07-31 08:21:00 · 538 阅读 · 0 评论 -
HDU 1083(图论,二分匹配)
<br /> Courses<br />Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 733 Accepted Submission(s): 349<br /><br />Problem DescriptionConsider a group of N students and P courses. Each student原创 2010-07-31 13:33:00 · 744 阅读 · 0 评论 -
HDU 3549(网络流)
Flow Problem<br />Time Limit: 5000/5000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)<br />Total Submission(s): 123 Accepted Submission(s): 78<br /><br />Problem DescriptionNetwork flow is a well-known difficult problem for ACMers. Given原创 2010-08-19 11:48:00 · 921 阅读 · 0 评论 -
PKU 2446(最大二分图匹配)
http://acm.pku.edu.cn/JudgeOnline/problem?id=2446#include <iostream>#include <vector>using namespace std;#define MAX 1050vector< vector<int> > map; int mark[MAX];bool flag[MAX];int nm,num;int dis[4][2] = {{0,1},{1,0},{-1,0},{0,-1}};bo原创 2010-08-23 11:15:00 · 583 阅读 · 0 评论 -
HDU 1350(最小路径覆盖)
Taxi Cab Scheme<br />Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 87 Accepted Submission(s): 46<br /><br />Problem DescriptionRunning a taxi station is not all that simple. Apart from th原创 2010-08-24 17:15:00 · 965 阅读 · 0 评论 -
PKU 2289(网络最大流(SAP) + 二分枚举)
Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 2847 Accepted: 912<br />DescriptionJamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list原创 2010-08-25 16:50:00 · 722 阅读 · 0 评论 -
ZOJ 1525(最小路径覆盖)
Air RaidTime Limit: 1 Second Memory Limit: 32768 KB Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking through town's streets you原创 2010-08-24 16:02:00 · 833 阅读 · 0 评论 -
PKU 3216(最小路径覆盖 + floyd)
Repairing CompanyTime Limit: 1000MS Memory Limit: 131072KTotal Submissions: 3986 Accepted: 1033<br />Description<br />Lily runs a repairing company that services the Q blocks in the city. One day the company receives M repair tasks, the ith of which occurs原创 2010-08-25 11:34:00 · 697 阅读 · 0 评论