c**********e
发帖数: 2007 | 1 1. You have N points (x_i, y_i) in a plane. Find their convex hull.
Complexity.
2. You have N points (x_i, y_i) in a plane. Find a circle containing most
points. complexity? 我其实不太清楚这个题是怎么问的。谁了解能不能说一下。
3. How to find the maximum rectangular in a histogram. You have the heights
of the histogram H[0]...H[N].
4. Give a matrix x[1...N][1...N], which contain 0, 1 only. How to find the
maximum rectangular which contain 0 only.
5. You have an array a[1...n]. Find the longest non-decreasing subarray. (
N | p*****k
发帖数: 318 | 2 careerchange, you might get more responses
(thus higher prob to learn new stuff) if you
also post it on jobhunting / programming board.
off the top of my head, 1 and 5 seem to be well-known:
http://en.wikipedia.org/wiki/Convex_hull_algorithms
http://en.wikipedia.org/wiki/Longest_increasing_subsequence
for 2, maybe the radius of the circle is given? |
|
