Codeforces 527C Glass Carving

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².

Sample test(s)

Input

4 3 4
H 2
V 2
V 3
V 1

Output

8
4
4
2

Input

7 6 5
H 4
V 3
V 5
H 2
V 1

Output

28
16
12
6
4

解题思路： multiset的典型应用，在此题中我们只需要维护横竖方向的切割位置和横竖方向的线段长度即可，在切割后最大面积的值便是横向最长线段长度*竖向最长线段长度即可。
涨姿势了。。。。
/* ***********************************************
Author        :sponge_wxy
Created Time  :2015年09月09日 星期三 15时13分19秒
File Name     :527C.cpp
************************************************ */

#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const ll  INF = 0x3f3f3f3f3f3f3f3fLL;
const double pi = acos(-1.0);

ll w, h, n, x;
char op;
multiset<ll> pos[2], len[2];


int main() {
		
	cin >> w >> h >> n;
	pos[0].insert(0); pos[0].insert(w); len[0].insert(w);
	pos[1].insert(0); pos[1].insert(h); len[1].insert(h);
	while(n--) {
		cin >> op >> x;
		int id = (op == 'H' ? 1 : 0);
		multiset<ll>::iterator it1 = pos[id].lower_bound(x);
		multiset<ll>::iterator it2 = it1; --it2;
		pos[id].insert(x);
		len[id].erase(len[id].find(*it1 - *it2));
		//len[id].erase(*it1 - *it2); 
		len[id].insert(*it1 - x); 
		len[id].insert(x - *it2);
		//cout << "Test: " << *it1 - *it2 << " " << *it1 - x << " " << x - *it2 << endl;
		cout << *len[0].rbegin() * *len[1].rbegin() << endl;
	}
	return 0;
}