Trapping_Rain_Water.cpp

/*
 Author:     Weixian Zhou, ideazwx@gmail.com
 Date:       Jul 27, 2012
 Problem:    Trapping Rain Water
 Difficulty: 
 Source:     http://www.leetcode.com/onlinejudge
 Notes:
 Given n non-negative integers representing an elevation map where the width of
 each bar is 1, compute how much water it is able to trap after raining.

 For example,
 Given [0,1,0,2,1,0,1,3,2,1,2,1], return 6.

 Solution:
 
 |
 |      | |   |
 _|__|_|__|_|_|_|_|_|
 */
#include <vector>
#include <set>
#include <climits>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
using namespace std;

class Solution {
public:
	int trap(int A[], int n) {

	}
};