Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water. http://leetcode.com/onlinejudge

leetcode_container_with_most_water.cpp

#include <algorithm>
using namespace std;

class Solution {
public:
    int maxArea(vector<int> &height) {
        int ret = 0;
        int left = 0, right = height.size() - 1;
        while (left < right) {
            ret = max(ret, (right - left) * min(height[left], height[right]));
            if (height[left] <= height[right])
                left++;
            else
                right--;
        } 
        return ret;
    }
};