年度博客排行
-
第1名
龙儿筝 -
第2名
宏天软件 -
第3名
青否云后端云 - wallimn
- vipbooks
- gashero
- wy_19921005
- benladeng5225
- fantaxy025025
- e_e
- javashop
- sam123456gz
- zysnba
- tanling8334
- arpenker
- kaizi1992
- xpenxpen
- lemonhandsome
- xiangjie88
- ganxueyun
- xyuma
- wangchen.ily
- Xeden
- jh108020
- zhanjia
- johnsmith9th
- zxq_2017
- jbosscn
- forestqqqq
- ajinn
- daizj
- wjianwei666
- ranbuijj
- 喧嚣求静
- silverend
- sichunli_030
- kingwell.leng
- lchb139128
- kristy_yy
- lich0079
- jveqi
- lzyfn123
- java-007
- sunj
- yeluowuhen
- lerf
- xiaoxinye
- flashsing123
- lxguy
- zhangjijun
最新文章列表
POJ-2195-Going Home
POJ-2195-Going Home
http://poj.org/problem?id=2195
最小费用最大流,假想一个源点,一个汇点
代码模仿网上的写的,还要再好好研究哇
#include<stdio.h>
#include<string.h>
#include<math.h>
#define maxn 300
#define INF ...
POJ-1273-Drainage Ditches
POJ-1273-Drainage Ditches
http://poj.org/problem?id=1273
基本的最大流,按LRJ的白书写的
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
#define INF 0x7fffffff
int ...
POJ-2828-Buy Tickets
POJ-2828-Buy Tickets
http://poj.org/problem?id=2828
线段树,逆序插入
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>using namespace std;#define N 200010struct ...