Largest Rectangle in a Histogram

ps：單調棧，注意紅色部分的代碼。 int n; stack<P> s; inline void upd(LL &x, LL y) { (x < y) && (x = y); } int main() { while(sc(n) != EOF && n) { while(!s.empty()) s.pop(); LL ans = 0; Rep(i, 1,

>>阅读原文<<