发表评论取消回复
相关阅读
相关 codeforces 25C. Roads in Berland
有n个城市,每个城市都能到达别的城市,n\n的矩阵表明i到j城市的最短距离,现在要建造一些新的道路,在两个城市之间。问每次建造这些道路之后每两个城市之间的距离之和为多少。 如
相关 Codeforces 25 D.Roads not only in Berland(并查集)
Description Berland Government decided to improve relations with neighboring countries.
相关 CodeForces - 723D - D. Lakes in Berland
-------------------- 题目连接:[http://codeforces.com/problemset/problem/723/D][http_codefor
相关 CodeForces 370 B.Berland Bingo(模拟)
Lately, a national version of a bingo game has become very popular in Berland. There are
相关 1044. Shopping in Mars (25)
Shopping in Mars is quite a different experience. The Mars people pay by chained diamond
相关 1118. Birds in Forest (25)
Some scientists took pictures of thousands of birds in a forest. Assume that all the bir
相关 HDU 1025 Constructing Roads In JGShining's Kingdom
原题目链接:[HDU1025][] -------------------- 分类 HDU 动态规划 最长上升子序列 --------------------
相关 CodeForces 455C
题意:给定N,M和Q,N表示有N个城市,M条已经修好的路,修好的路是不能改变的,然后是Q次操作,操作分为两种,一种是查询城市x所在的联通集合中,最长的路为多长。二是连接两个联
相关 1475C Ball in Berland (思维)
[题目][Link 1] 思路:看N为2e5可知复杂度为O(n)或O(nlogn),在这我用两个map分别记录每个男和女各自可以和多少匹配,首先选好一组匹配,那么还可以找
相关 B. Berland Crossword (构造)
[题目][Link 1] 对于下面这个图可以知道当U涂中间三个时是不会对其它的三种产生限制的,而如果涂了4个则必然会占到L R其中一个相邻的格子,涂了5个必然会占掉相邻的
还没有评论,来说两句吧...