Codeforce-527C Glass Carving

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

Examples

input

Copy

4 3 4
H 2
V 2
V 3
V 1

output

Copy

8
4
4
2

input

Copy

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

output

Copy

28
16
12
6
4

Note

Picture for the first sample test:

Picture for the second sample test:

 

 

https://blog.csdn.net/Floraqiu/article/details/79134595这篇博客讲的很好。

要求最大面积,就是要求最大的宽和高

下面是代码,对上面博客的代码进行了部分注释。

#include <cstdio>
#include <set>
using namespace std;
int w, h, n, t;
char ch[3];

int main()
{
    set<int> cutPosH, cutPosV;          // 水平切割的位置,垂直切割的位置
    multiset<int> maxH, maxV;           // 保存切割后产生的高和宽,各自最大的即为最大高和最大宽,两者乘积即为最大面积
    // 初始时为一整块玻璃
    scanf("%d %d %d", &w, &h, &n);
    cutPosH.insert(0);
    cutPosH.insert(h);
    cutPosV.insert(0);
    cutPosV.insert(w);
    maxH.insert(h);
    maxV.insert(w);
    for(int i = 0; i < n; i++)
    {
        scanf("%s %d", ch, &t);
        set<int>::iterator cur, pre, next;
        multiset<int>::iterator _erase_, endH, endV;
        if(ch[0] == 'H')
        {
            cutPosH.insert(t);
            pre = next = cur = cutPosH.find(t);
            pre--;
            next++;
            _erase_ = maxH.find(*next - *pre);      // 删除原来的边
            maxH.erase(_erase_);
            maxH.insert(*cur - *pre);
            maxH.insert(*next - *cur);
        }
        else
        {
            cutPosV.insert(t);
            pre = next = cur = cutPosV.find(t);
            pre--;
            next++;
            _erase_ = maxV.find(*next - *pre);
            maxV.erase(_erase_);
            maxV.insert(*cur - *pre);
            maxV.insert(*next - *cur);
        }
        endH = maxH.end();endH--;
        endV = maxV.end();endV--;
        printf("%lld\n", (long long)(*endH) * (long long)(*endV));
    }
    return 0;
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值