CF 527C Glass Carving - multiset的使用

题目链接

C. Glass Carving

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Leonid wants to become a glass carver (the person who creates beautiful artworks by cutting the glass). He already has a rectangular wmm  ×  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 mm2.

Examples

input4 3 4
H 2
V 2
V 3
V 1

output8
4
4
2

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

output
28
16
12
6
4

Note

Picture for the first sample test:

Picture for the second sample test:

 

题目大意：

一块矩形的玻璃，给出高和宽，有n次切割，每次都在水平或者竖直方向切一刀，问每次切割后剩下的最大的玻璃块的面积

解法：

最大的玻璃块面积 = 最大的宽 * 最大的高

每切一刀可以将一个高度分割成两个高度，或者将一个宽度分割成两个宽度

我们只要将所有玻璃块的高度和宽度装入两个multiset中，每次切割时维护这两个multiset，由于multiset是有序的，每次输出的就是两个multiset的尾元素的乘积

使用multiset是因为玻璃块的高度和宽度可能有重复的情况

还需要开两个set来维护高和宽的断点，断点没有重复的情况

 

具体代码如下：

#include<cstdio>
#include<iostream>
#include<set>
using namespace std;
#define LL long long
#define N 100005

multiset<int> kuan, gao;
set<int> wd, hg;

int main() {
    int w, h, n, tmp;
    char c;
    scanf("%d%d%d",&w, &h, &n);
    wd.insert(0), wd.insert(w);
    hg.insert(0), hg.insert(h);
    kuan.insert(w);
    gao.insert(h);
    for (int i = 1; i <= n; i++) {
        getchar();
        scanf("%c %d",&c, &tmp);
        if (c == 'H') {
            set<int> :: iterator it = hg.lower_bound(tmp);
            set<int> :: iterator it2 = it;
            it2--;
            //printf("*it = %d, *it2 = %d\n",*it, *it2);
            int len = *it - *it2;
            multiset<int> :: iterator it3 = gao.lower_bound(len);
            gao.erase(it3);// 从集合中删掉被切割的高度
            hg.insert(tmp);// 添加断点
            gao.insert(tmp - *it2);// 添加新加的两段高度
            gao.insert(*it - tmp);
            it = --kuan.end();
            it2 = --gao.end();
            printf("%I64d\n",1LL * (*it) * (*it2));
        }
        else {
            set<int> :: iterator it = wd.lower_bound(tmp);
            set<int> :: iterator it2 = it;
            it2--;
            int len = *it - *it2;
            //printf("*it = %d, *it2 = %d\n",*it, *it2);
            multiset<int> :: iterator it3 = kuan.lower_bound(len);
            kuan.erase(it3);
            wd.insert(tmp);
            kuan.insert(tmp - *it2);
            kuan.insert(*it - tmp);
            it = --kuan.end();
            it2 = --gao.end();
            printf("%I64d\n",1LL * (*it) * (*it2));
        }
    }
    return 0;
}