CodeForces - 527C

Leonid wants to become a glass carver (the person who creates beautiful artworks by cutting the glass). He already has a rectangular w mm  ×  h mm sheet of glass, a diamond glass cutter and lots of enthusiasm. What he lacks is understanding of what to carve and how.

In order not to waste time, he decided to practice the technique of carving. To do this, he makes vertical and horizontal cuts through the entire sheet. This process results in making smaller rectangular fragments of glass. Leonid does not move the newly made glass fragments. In particular, a cut divides each fragment of glass that it goes through into smaller fragments.

After each cut Leonid tries to determine what area the largest of the currently available glass fragments has. Since there appear more and more fragments, this question takes him more and more time and distracts him from the fascinating process.

Leonid offers to divide the labor — he will cut glass, and you will calculate the area of the maximum fragment after each cut. Do you agree?

Input

The first line contains three integers w, h, n (2 ≤ w, h ≤ 200 000, 1 ≤ n ≤ 200 000).

Next n lines contain the descriptions of the cuts. Each description has the form H y or V x. In the first case Leonid makes the horizontal cut at the distance y millimeters (1 ≤ y ≤ h - 1) from the lower edge of the original sheet of glass. In the second case Leonid makes a vertical cut at distance x (1 ≤ x ≤ w - 1) millimeters from the left edge of the original sheet of glass. It is guaranteed that Leonid won't make two identical cuts.

Output

After each cut print on a single line the area of the maximum available glass fragment in mm².

题目大意：有一块w*h的玻璃，可以水平或垂直的切割该玻璃。现在给出每次切割的位置，问每次切割后最大块玻璃的面积。

思路：multiset处理。找最大长和最大宽，两个相乘即为所求面积。每次切割更新小玻璃块的长和宽，由于长和宽最大值不唯一，所以采用multiset处理。

代码如下：

#include<iostream>
#include<cstdio>
#include<set>
#include<cstring>
using namespace std;

int main()
{
	int w,h,n,cut;
	char c[2];
	set<int> x,y;
    multiset<int> mh,mw;
	while(~scanf("%d%d%d",&w,&h,&n))
	{
	  y.clear();x.clear();
	  mh.clear();mw.clear();
	  y.insert(0);x.insert(0);
	  y.insert(h);x.insert(w);
	  mh.insert(h);mw.insert(w);
	  while (n--)
	  {
		cin>>c>>cut;
		if (c[0]=='V')
		{
			x.insert(cut);
			int pre=*(--x.find(cut));
			int next=*(++x.find(cut));
			mw.erase(mw.find(next-pre));
			mw.insert(next-cut);
			mw.insert(cut-pre);
		}
		else
		{
			y.insert(cut);
			int pre=*(--y.find(cut));
			int next=*(++y.find(cut));
			mh.erase(mh.find(next-pre));
			mh.insert(next-cut);
			mh.insert(cut-pre);
		}
		cout<<(long long)*(--mh.end())**(--mw.end())<<endl;
	   }
    }
    return 0;
 }