I am a lazy duck. However, I want to make some changes. So, today, here, that is the first step on my road. My trip begins. And, I Will never stop :) ...
分类：
其他好文 时间：
2016-06-13 01:00:57
阅读次数：
171
传送门：http://www.lydsy.com/JudgeOnline/problem.php?id=1116 题目大意：Byteotia城市有n个 towns m条双向roads. 每条 road 连接 两个不同的 towns ,没有重复的road. 你要把其中一些road变成单向边使得：每个t ...
分类：
其他好文 时间：
2016-06-12 18:38:50
阅读次数：
124
Description In a country there are n cities connected by m one way roads. You can paint any of these roads. To paint a road it costs d unit of money w ...
分类：
其他好文 时间：
2016-06-10 16:13:55
阅读次数：
232
Description Berland has n cities connected by m bidirectional roads. No road connects a city to itself, and each pair of cities is connected by no mor ...
分类：
其他好文 时间：
2016-06-06 21:51:54
阅读次数：
325
I am going to my home. There are many cities and many bi-directional roads between them. The cities are numbered from 0 to n-1 and each road has a cos ...
分类：
编程语言 时间：
2016-06-06 20:40:16
阅读次数：
351
Ikki's Story I - Road Reconstruction Time Limit: 2000MS Memory Limit: 131072K Total Submissions: 7491 Accepted: 2172 Description Ikki is the king of a ...
分类：
其他好文 时间：
2016-06-03 22:56:18
阅读次数：
493
题目连接： http://poj.org/problem?id=3744 题意： 有个人要到一个叫“mine road”的地方，路线是一条直线，起点在1，路上有N个地雷，坐标在[1, 100000000]之间，这人每次有p(0.25≤p≤0.75)的概率向前走一步，且有1-p的概率向前走两步，问这货 ...
分类：
其他好文 时间：
2016-06-01 19:49:34
阅读次数：
175
题目链接:传送门 题目大意:给你一副无向图,问至少加多少条边使图成为边双联通图 题目思路:tarjan算法加缩点，缩点后求出度数为1的叶子节点个数，需要加边数为(leaf+1)/2 ...
分类：
移动开发 时间：
2016-05-24 20:41:48
阅读次数：
368
