NEU 1685: All Pair Shortest Path
摘要:题目描述 Bobo has a directed graph G with n vertex labeled by 1,2,3,..n. Let D(i,j) be the number of edges from vertex i to vertex j on the shortest path.
阅读全文
posted @
2016-03-22 11:29
Beserious
阅读(234)
推荐(0) 编辑
NEU 1683: H-Index
摘要:题目描述 Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. Acco
阅读全文
posted @
2016-03-22 11:21
Beserious
阅读(186)
推荐(0) 编辑
1682: 全球变暖
摘要:由于全球变暖,岛国S的沿岸的海水不断上涨,形式岌岌可危。 S国的地图是由n*m个网格组成的,网格由.和#组成,#代表的区域是陆地,.和地图外面全是海水。 每天,海水将侵蚀相邻的陆地,即如果陆地与海水相邻的话,第二天就会变成海水。这里面的两块相邻表示两块之间公用一条边。 比如S国的地图是这样的: ..
阅读全文
posted @
2016-03-22 11:13
Beserious
阅读(275)
推荐(0) 编辑
NEU 1681: The Singles
摘要:题目描述 The Signals’ Day has passed for a few days. Numerous sales promotion campaigns on the shopping sites make us forget that 11.11 is the Signals’ Da
阅读全文
posted @
2016-03-22 11:06
Beserious
阅读(375)
推荐(0) 编辑