CodeForces 527C：Glass Carving （set与multiset应用）

Glass Carving

Time limit:1000 ms Memory limit:65536 kB OS:Linux

---

Problem Description

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.
The gourmet can instantly switch between the dishes but only at integer moments in time. It is allowed to return to a dish after eating any other dishes. Also in every moment in time he can eat no more than one dish.

Example

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

Note

Picture for the first sample test:

Picture for the second sample test:

---

题意：

给出一个w*h大小的矩形玻璃，进行n次切割，切割方向为水平或者垂直，输入切割方向与坐标，问每次切完后最大玻璃片的面积。

解题思路：

（参照周杰辉的思路）
用2个set分别记录长和宽的切割点，再用两个multiset记录切割后的长和宽中区间段的长度。
初始将长宽边界和长度插入set和multiset，再将切割点插入set，用find找出其位置，确定相邻切割点(a,b)，在相应的multiset中删除一个(b-a)区间，最大的面积就是两个multiset中最大值的乘积。

因为没注意到200 000*200 000会爆int,没用long long输出最后结果导致WA

心得：

由于对STL的东西使用还不够熟练，不知道set是不能用 s.begin()+5 这样随机访问的，导致好久都没过编译，在大佬的帮助下发现了问题，把原来s.find(x)+1等改成了++s.find()，然后就都解决了。

---

Code：

#include <iostream>
#include <algorithm>
#include <set>
#include <cstdio>

using namespace std;

set<int> Ws;
set<int> Hs;
multiset<int> wms;
multiset<int> hms;

int main()
{
    int w,h,n;
    scanf("%d%d%d",&w,&h,&n);
    Ws.insert(0);
    Ws.insert(w);
    Hs.insert(0);
    Hs.insert(h);
    wms.insert(w);
    hms.insert(h);
    for(int i=0; i<n; i++)
    {
        char o;
        int x;
        getchar();
        scanf("%c%d",&o,&x);
        if(o=='H')
        {
            Hs.insert(x);
            int a=*(--Hs.find(x));
            int b=*(++Hs.find(x));
            hms.erase(hms.find(b-a));
            hms.insert(x-a);
            hms.insert(b-x);
            //cout<<a<<' '<<x<<' '<<b<<endl;
        }
        else
        {
            Ws.insert(x);
            int a=*(--Ws.find(x));
            int b=*(++Ws.find(x));
            wms.erase(wms.find(b-a));
            wms.insert(x-a);
            wms.insert(b-x);
            //cout<<a<<' '<<x<<' '<<b<<endl;
        }

        long long maxh=*(--hms.end());
        long long maxw=*(--wms.end());
        printf("%I64d\n",maxh*maxw);
    }

    return 0;
}