leetcode - Largest Rectangle in Histogram

class Solution {
public:
int largestRectangleArea(vector<int> &height) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
int n = height.size();
if (n<=0)
return 0;
int * hgt = new int
;
int i = 0, j;
bool * flag = new bool
;
for (vector<int>::iterator ii = height.begin(); ii!=height.end(); ii++){
hgt[i] = *ii;
flag[i] = false;
i++;
}
int rlt = 0;
for (i=0; i<n; i++){
if (flag[i])
continue;
if (rlt/(n-i) >= hgt[i])
continue;
int minH = hgt[i];
int area = hgt[i];
for (j=i+1; j<n; j++){
if (hgt[j] >= minH){
area += minH;
}
else{
flag[j] = true;
if (area>rlt)
rlt = area;
if (hgt[j]<=rlt/(n-i))
break;
minH = hgt[j];
area = hgt[j]*(j-i+1);
}
}
if (area>rlt)
rlt = area;
}
return rlt;
}
};