howell

D. Graph And Its Complementtime limit per test：2 secondsmemory limit per test：256 megabytesinput：standard inputoutput：standard outputGiven three numbers n,a,bn,a,b. You need to find an adjacency matri...

畅通工程续                                                                  Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Problem Description某省自从实行了很多年的畅通工程计划后，终于修建了很多路...

1741. Communication FiendTime limit: 1.0 secondMemory limit: 64 MBKolya has returned from a summer camp and now he's a real communication fiend. He spends all his free time on the Web chatting with hi...

B - Prime Independence 1356 - Prime Independence   PDF (English)StatisticsForumTime Limit: 3 second(s)Memory Limit: 32 MBA set of integers is called prime independent if none of its member is a prime ...

任务：给定一个二分图，用Hopcroft-Karp算法求这个二分图的最大匹配数。 说明： dx[/]，dy[/]" role="presentation">dx[/]，dy[/]dx[/]，dy[/]dx[/]，dy[/]分别表示二分图左右部顶点的距离标号； mx[/]，my[/]" role="presentation">mx[/]，my[/]mx[/]，my[

Air RaidTime Limit: 1000MS Memory Limit: 10000KAccepted: 5235DescriptionConsider a town where all the streets are one-way and each street leads from one intersection to another. It is also

Machine ScheduleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 15974 Accepted: 6837DescriptionAs we all know, machine scheduling is a very classical problem in computer s

CoursesTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9264 Accepted Submission(s): 4493Problem DescriptionConsider a group of N st

过山车 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Accepted Submission(s): 11237Problem Description RPG girls今天和大家一起去游乐场玩，终于可以坐上梦寐以求的过山车了。可是，过山车的

任务：给定一个二分图，用匈牙利算法求这个二分图的最大匹配数。说明：求最大匹配，那么我们希望每一个在左边的点尽量找到右边的一个点和它匹配。我们一次枚举左边的点x" role="presentation">xxx的所有出边指向的点y" role="presentation">yyy，若y" role="presentation">yyy之前没有被匹配，那么（x&#xFF0

L2-001. 紧急救援最短路变形。。。。#include <bits/stdc++.h>#include <algorithm>using namespace std;int const MAX = 505;int const INF = 0x3fffffff;int mp[MAX][MAX], val[MAX], path[MAX], dis[MAX], re...

我认为这个模板好记。。。。。。模板代码：const int maxn = 100+7;const int INF = 1e5+7;struct gg{ int first; int second;};vector<gg> g[maxn];bool v[maxn];int dis[maxn],N;int prim() { memse...

L2-013. 红色警报图的连通性， 深搜标记一下。。。。代码：#include<bits/stdc++.h>using namespace std;#define ll long longconst int maxn = 507;int v[maxn][maxn], n, m, k = 0;bool vis[maxn];void dfs(int x) { ...

题目链接：Oil Deposits UVA - 572 题目：输入一个mmm行nnn列的字符矩阵，统计字符“@”组成多少个八连块。如果两个字符“@”所在的格子相邻（横、竖或者对角线方向），就说它们输入同一个八连块。如图： 思路：种子填充（floodfill）。代码：#include<iostream>#include<string>#include&l...

C. A Mist of Florescencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs the boat drifts down the river, a wood full of blossoms shows up on the ...

题目：n*n的方格中可能有monster，Shino只能在一行一列只能杀一个，求尽可能多的杀monster获得经验的最小值最大。题解：每次二分最小值，二分匹配，我习惯用最大流跑。。。具体一点就是说一开始先确定杀得怪物最多有多少个，如果是0个，那么输出0,否则二分最小值，最大流匹配，判断满足杀最多的monster获得经验的最小值最大，最后就得到答案啦。代码：#include<...