Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matr...
分类：
其他好文 时间：
2015-08-08 14:52:24
阅读次数：
102
hdu 2795 的传送门–>Problem Description
At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible...
分类：
其他好文 时间：
2015-08-08 13:38:45
阅读次数：
141
Problem Description
At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place where all possible announcements ...
分类：
其他好文 时间：
2015-08-08 12:05:48
阅读次数：
102
题目大意：给出一张有向图G，求一个结点数最大的结点集，使得该点集中任意两个结点u和v满足：
要么u可到达v，要么v可以到达u（u和v互相可达也可以）解题思路：u和v相互可达的时候，就是两个结点在同一个强连通分量内的时候
首先要保证集合里面的点可达：强连通分量就满足集合内的点都相互可达。所以第一件事就是找出所有的强连通分量，并统计出每个强连通分量内的结点数然后找出每个强连通分量之间的关系，也就是找...
分类：
其他好文 时间：
2015-08-07 22:24:09
阅读次数：
262
Given a 2D binary matrix filled with 0's and 1's, find the largest square containing all 1's and return its area.For example, given the following matr...
分类：
其他好文 时间：
2015-08-07 21:54:10
阅读次数：
116
Flip Game
Time Limit: 1000MS
Memory Limit: 65536K
Total Submissions: 34437
Accepted: 15058
Description
Flip game is played on a rectangular 4x4 field with two-sided pie...
分类：
其他好文 时间：
2015-08-07 00:29:51
阅读次数：
155
Walking Ant
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Ants are quite diligent. They sometimes build their nests beneath flagstones.
Here, an ant is walking in a rectangular area tiled...
分类：
其他好文 时间：
2015-08-06 22:37:47
阅读次数：
169
Walking Ant
Time Limit: 2 Seconds
Memory Limit: 65536 KB
Ants are quite diligent. They sometimes build their nests beneath flagstones.
Here, an ant is walking in a rectangular area tile...
分类：
其他好文 时间：
2015-08-06 22:28:24
阅读次数：
143
Walking Ant
Time Limit: 2 Seconds
Memory Limit: 65536 KB
点击打开链接
Ants are quite diligent. They sometimes build their nests beneath flagstones.
Here, an ant is walking in a rectangular are...
分类：
其他好文 时间：
2015-08-06 22:24:41
阅读次数：
232
Find thekth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For exampl...
分类：
其他好文 时间：
2015-08-06 22:09:52
阅读次数：
120
