图 - 随笔分类 - joeylee97

Test for Job 图上的动态规划（DAG）

摘要：Test for Job Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 11399 Accepted: 2697 Description Mr.Dog was fired by his company. In order to 阅读全文

posted @ 2017-09-30 13:24 joeylee97 阅读(201) 评论(0) 推荐(0)

POJ 2983 Is the Information Reliable? 差分约束

摘要：Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 14143 Accepted: 4439 Description The galaxy war between the Empire Draco and the Commonwea 阅读全文

posted @ 2017-09-19 18:52 joeylee97 阅读(247) 评论(0) 推荐(0)

POJ 2101 Intervals 差分约束

摘要：Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 27746 Accepted: 10687 Description You are given n closed, integer intervals [ai, bi] and n 阅读全文

posted @ 2017-09-19 16:48 joeylee97 阅读(141) 评论(0) 推荐(0)

1227 方格取数 2

摘要：题目描述 Description 给出一个n*n的矩阵,每一格有一个非负整数Aij,(Aij <= 1000)现在从(1,1)出发,可以往右或者往下走,最后到达(n,n),每达到一格,把该格子的数取出来,该格子的数就变成0,这样一共走K次,现在要求K次所达到的方格的数的和最大题目描述 Descri 阅读全文

posted @ 2017-09-15 15:41 joeylee97 阅读(215) 评论(0) 推荐(0)

1033 蚯蚓的游戏问题

摘要：题目描述 Description 在一块梯形田地上，一群蚯蚓在做收集食物游戏。蚯蚓们把梯形田地上的食物堆积整理如下： a(1,1) a(1,2)…a(1,m) a(2,1) a(2,2) a(2,3)…a(2,m) a(2,m+1) a(3,1) a (3,2) a(3,3)…a(3,m+1) a( 阅读全文

posted @ 2017-09-15 15:08 joeylee97 阅读(262) 评论(0) 推荐(0)

有向无环图（DAG）的最小路径覆盖

摘要：定理：柯尼希定理：二分图最小点覆盖的点数=最大匹配数。最小路径覆盖的边数=顶点数n-最大匹配数最大独立集=最小路径覆盖=顶点数n-最大匹配数增广路定理：用未盖点表示不与任何匹配边邻接的点，其他点位匹配点，即恰好和一条匹配边临界的点。从未盖点出发，依次经过非匹配边，匹配边，非匹配边，匹配边。。阅读全文

posted @ 2017-09-15 11:21 joeylee97 阅读(765) 评论(0) 推荐(0)

1035 火车停留最大费用最大流

摘要：1035 火车停留时间限制: 1 s 空间限制: 128000 KB 题目等级 : 大师 Master 题解查看运行结果 1035 火车停留 1035 火车停留时间限制: 1 s 空间限制: 128000 KB 题目等级 : 大师 Master 时间限制: 1 s 空间限制: 128000 K 阅读全文

posted @ 2017-09-14 17:16 joeylee97 阅读(188) 评论(0) 推荐(0)

transaction transaction transaction 最大费用最大流转化到SPFA最长路

摘要：//当时比赛的时候没有想到可以用SPFA做，TLE！ Problem Description Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in m 阅读全文

posted @ 2017-09-13 16:15 joeylee97 阅读(118) 评论(0) 推荐(0)

Our Journey of Dalian Ends 乌鲁木齐网络赛最小费用最大流

摘要：Life is a journey, and the road we travel has twists and turns, which sometimes lead us to unexpected places and unexpected people. Now our journey of 阅读全文

posted @ 2017-09-13 14:53 joeylee97 阅读(164) 评论(0) 推荐(0)

Perfect Service UVA - 1218

摘要：#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef... 阅读全文

posted @ 2017-09-07 12:34 joeylee97 阅读(202) 评论(0) 推荐(0)

Less Time, More profit 最大权闭合子图（最大流最小割）

摘要：The city planners plan to build N plants in the city which has M shops. Each shop needs products from some plants to make profit of proiproi units. Bu 阅读全文

posted @ 2017-08-25 10:41 joeylee97 阅读(152) 评论(0) 推荐(0)

Arctic Network POJ - 2349

摘要：The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies a 阅读全文

posted @ 2017-08-21 12:58 joeylee97 阅读(144) 评论(0) 推荐(0)

Meeting 加虚拟边

摘要：Bessie and her friend Elsie decide to have a meeting. However, after Farmer John decorated his fences they were separated into different blocks. John' 阅读全文

posted @ 2017-08-19 09:26 joeylee97 阅读(276) 评论(0) 推荐(0)

How many ways?? 矩阵快速幂邻接矩阵意义

摘要：春天到了, HDU校园里开满了花, 姹紫嫣红, 非常美丽. 葱头是个爱花的人, 看着校花校草竞相开放, 漫步校园, 心情也变得舒畅. 为了多看看这迷人的校园, 葱头决定, 每次上课都走不同的路线去教室, 但是由于时间问题, 每次只能经过k个地方, 比方说, 这次葱头决定经过2个地方, 那他可以先去问阅读全文

posted @ 2017-08-19 09:10 joeylee97 阅读(339) 评论(0) 推荐(0)

Minimum Transport Cost Floyd 输出最短路

摘要：These are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should b 阅读全文

posted @ 2017-08-11 08:59 joeylee97 阅读(140) 评论(0) 推荐(0)

bitset优化FLOYD HDU 3275

摘要：Each of Farmer John's N cows (1 ≤ N ≤ 1,000) produces milk at a different positive rate, and FJ would like to order his cows according to these rates 阅读全文

posted @ 2017-08-09 19:21 joeylee97 阅读(417) 评论(0) 推荐(0)

Stockbroker Grapevine POJ 1125 Floyd

摘要：Stockbroker Grapevine Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 37069 Accepted: 20612 Description Stockbrokers are known to overreact 阅读全文

posted @ 2017-08-09 18:36 joeylee97 阅读(199) 评论(0) 推荐(0)

HDU - 2647 Reward 拓扑排序

摘要：Problem Description Dandelion's uncle is a boss of a factory. As the spring festival is coming , he wants to distribute rewards to his workers. Now he 阅读全文

posted @ 2017-08-09 16:36 joeylee97 阅读(199) 评论(0) 推荐(0)

强连通图 HDU - 1269

摘要：为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N<=10000)和M条通道(M<=100000)，每个通道都是单向的，就是说若称某通道连通了A房间和B房间，只说明可以通过这个通道由A房间到达B房间，但并不说明通过它可以由B房间到达A房间。Gardon需要请你写个程序确认一下是否阅读全文

posted @ 2017-08-08 16:45 joeylee97 阅读(152) 评论(0) 推荐(0)

POJ 1523 SPF 割点 Tarjan

摘要：SPF Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9317 Accepted: 4218 Description Consider the two networks shown below. Assuming that da 阅读全文

posted @ 2017-08-08 15:33 joeylee97 阅读(177) 评论(0) 推荐(0)

joeylee97

随笔分类 - 图

公告