skyline

http://acm.hdu.edu.cn/showproblem.php?pid=1532第一道最大流～此题是最基本的。照着刘书写的～～#include #include #include #include using namespace std;int cap[500][500];int flow[500][500];int a[500];int main(){

思路见来自某大牛：题目大意：n个男孩n个女孩，女孩选男孩，每个女孩都要选到不同的人k对女孩有相同选择标准，女孩每轮都选择没选过的男孩，问总共能选几轮。题解：女孩1..n，男孩n+1..2*n编号由女孩到男孩建容量为1的边起点st=2*n+1，到1..n建边；n+1..2*n到终点ed=2*n+2建边二分搜索最大容量即为答案；#include #include #include #defi

Pleasant sheep and big big wolfTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1601    Accepted Submission(s): 687Problem Descriptio

ThievesTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 997    Accepted Submission(s): 448Problem DescriptionIn the kingdom of He

和hdu1565很像，但此题必须用邻接表存~用判断奇偶进行建立二分图#include #include #include #include #define inf 99999999using namespace std;struct node{ int u,v,f;};node e[60000];int map[55][55],first[2505],cc;i

这道题和3081很像，，n+1----n+1+m 建立容量为k的边，如果map[i][j]==1 建立i---n+m+j容量为1的边  否则建i----n+j容量为1的边 然后二分具体见代码。。还有一般数组适当开大，不要太大，会TLE...#include #include #include #include #define MAXN 500#define inf 0x3f3f3

FoodTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1668    Accepted Submission(s): 606Problem Description　　You, a part-time din

拆边1,3,5,7。。建图即可#include #include #include #include #define inf 0x3f3f3f3f#define MAXN 2000#define MAXM 50000using namespace std;struct node{ int u,v,f,c;};node e[MAXM];int first[MAXN

http://acm.hdu.edu.cn/showproblem.php?pid=4309看了看别人的报告~~感觉二进制枚举很巧妙，学习了，。。#include #include #include #define MAXN 2000#define MAXM 20000#define inf 0x3f3f3f3fusing namespace std;struct node

先是最小费用流写~~超时，看了看别人的~~两次最短路，把最短路上的边加入网络流图。再运行最大流。求最小割~~#include #include #include #define MAXN 2000#define MAXM 200000#define inf 0x3f3f3f3fusing namespace std;struct node{ int u,v,f;}

Treasure HuntingTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 903    Accepted Submission(s): 228Problem DescriptionDo you lik

My BruteTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 492    Accepted Submission(s): 180Problem DescriptionSeaco is a beautifu

http://acm.hdu.edu.cn/showproblem.php?pid=2448和那个在地图上回家的差不多~~~station之间是无向的，port与station是有向的，因为进去就不能出来。费用流建图，即可#include #include #include #include #define inf 0x3f3f3f3f#define MAXN 3000

还不会km啊~#include #include #include #include #define inf 0x3f3f3f3f#define MAXN 3000#define MAXM 30000using namespace std;struct node{ int u,v,f,c;};node e[MAXM];int first[MAXN],next[M

SPOJ Problem Set (classical)13041. The Black RidersProblem code: AMR12A 'Hush!' said Frodo. 'I think I hear hoofs again.'They stopped suddenly and stood as silent as tree-s

http://hi.baidu.com/yy17yy/item/a7896b345eaa81f3e6bb7a593604WA了,,实在调不动了,,,, 这个题,,直接建图会TLE,,,, 压缩:把人的可选集合看作一个状态,,,那么,,,最多会有1024个状态,,,而人总数有10万个,,就是说有大量重复,

Leapin' LizardsTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 20   Accepted Submission(s) : 13Problem DescriptionYour platoon of

第一道额～～#include#include #include #include using namespace std;int map[555][555];int flag[555];int link1[555];int n,m;int can(int i){ int j; for(j=1;j<=m;j++) { if(!flag[

http://acm.hdu.edu.cn/showproblem.php?pid=1054#include#include#includeusing namespace std;struct arcnode{ int adjvex; arcnode *next; arcnode():adjvex(-1),next(0){}};struct vnode{ arcnode

http://acm.hdu.edu.cn/showproblem.php?pid=1498刚开始题目没理解汗～～将横坐标作为x集合纵坐标为y集合 每个颜色的坐标对应一条边，求最小点（横或纵，即为需要射击的次数）覆盖对应边的个数，代码：/*************************************************************************

http://acm.hdu.edu.cn/showproblem.php?pid=4160#include#include#includeusing namespace std;struct node{ int wi,li,hi;};node a[505];int map[505][505];int n;int link1[505];int vis[505];voi

http://acm.hdu.edu.cn/showproblem.php?pid=1150图的最小点覆盖数 = 图的最大匹配数；konig定理：二分图的最小顶点覆盖数等于最大匹配数。证明：比如最大匹配是M。为了求最少的点让每条边都至少和其中一个点关联。M个点是足够的。就是说他们覆盖最大匹配的那M条边后，假设有某边e没被覆盖，那么把e加入后会得到一个更大的匹配，出现矛盾。

http://acm.hdu.edu.cn/showproblem.php?pid=1350/************************************************************************* > File Name: main.cpp > Author: huangshuai > Mail: huangshuai1993@gmail.co

#include#include#includeusing namespace std;int map[305][305];int vis[305];int link1[305];int link2[305],p,n;int dfs(int i){ int j; for(j=1;j<=n;j++) { if(map[i][j]&&!vis[j]) { vis[

http://acm.hdu.edu.cn/showproblem.php?pid=1068#include#include#includeusing namespace std;int map[505][505];int link1[505];int vis[505],t;int dfs(int i){ int j; for(j=0;j<t;j++) { if(ma

Random MazeTime Limit: 10000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 908    Accepted Submission(s): 298Problem DescriptionIn the game “A

Cyclic TourTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/65535 K (Java/Others)Total Submission(s): 914    Accepted Submission(s): 466Problem DescriptionThere are N citi

Going HomeTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2018    Accepted Submission(s): 991Problem DescriptionOn a grid map t

A new Graph GameTime Limit: 8000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1010    Accepted Submission(s): 454Problem DescriptionAn undirec

MatrixTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1008    Accepted Submission(s): 560Problem DescriptionYifenfei very like p

Task ScheduleTime Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 71   Accepted Submission(s) : 20Problem DescriptionOur geometry princ

Optimal MilkingTime Limit : 4000/2000ms (Java/Other)   Memory Limit : 60000/30000K (Java/Other)Total Submission(s) : 1   Accepted Submission(s) : 1Problem DescriptionFJ has moved his K