本月博客排行
-
第1名
Xeden -
第2名
fantaxy025025 -
第3名
bosschen - paulwong
- johnsmith9th
年度博客排行
-
第1名
青否云后端云 -
第2名
宏天软件 -
第3名
gashero - gengyun12
- wy_19921005
- vipbooks
- e_e
- benladeng5225
- wallimn
- ranbuijj
- javashop
- jickcai
- fantaxy025025
- zw7534313
- qepwqnp
- robotmen
- 解宜然
- ssydxa219
- sam123456gz
- zysnba
- sichunli_030
- tanling8334
- arpenker
- gaojingsong
- xpenxpen
- kaizi1992
- wiseboyloves
- jh108020
- xyuma
- ganxueyun
- wangchen.ily
- xiangjie88
- Jameslyy
- luxurioust
- mengjichen
- lemonhandsome
- jbosscn
- nychen2000
- zxq_2017
- lzyfn123
- wjianwei666
- forestqqqq
- ajinn
- siemens800
- hanbaohong
- 狂盗一枝梅
- java-007
- zhanjia
- 喧嚣求静
- Xeden
最新文章列表
poj 2239 Selecting Courses
Selecting Courses
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 7144
Accepted: 3141
题目链接:http://poj.org/problem?id=2239
Description
It is w ...
poj_1469 COURSES
COURSES
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 13861
Accepted: 5481
题目链接:http://poj.org/problem?id=1469
Description
Consider a group ...
poj_2063 过山车
过山车
Time Limit:1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K(Java/Others) Total Submission(s): 5197 Accepted Submission(s): 2292
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2063
...
poj_1274 The Perfect Stall
The Perfect Stall
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 14473
Accepted: 6621
题目链接:http://poj.org/problem?id=127 ...
hdu 过山车 二分匹配模板
#include <stdio.h>
#include <cstring>
bool map[501][501];
bool vis[501];
int match[501];
int n,m;//注意,定义在主函数里的变量在main函数里面不能再定义。否则就失效,按0来计算!
bool find(int x)//寻找A可能匹配的点集合
{
for(int i=1; ...
Machine Schedule 二分图最大匹配基础题
#include <stdio.h>
#include <cstring>
bool map[101][101];
bool vis[101];
int match[101];
int n,m,k;
bool find(int x)
{
for(int i=1;i<=m;i++)
{
if(!vis[i]&&map[x][ ...
【最大流+Dinic+Edmonds_Karp+二分匹配】北大 poj 1698 Alice's Chance
Dinic 算法
/* THE PROGRAM IS MADE BY PYY */
/*----------------------------------------------------------------------------//
Copyright (c) 2011 panyanyany All rights reserved.
URL : ht ...