51nod 1562 玻璃切割 (set)

#include<stdio.h>
#include<iostream>
#include<set>
using namespace std;
typedef long long LL;

const int maxn = 200010;
LL ans[maxn];
int x[maxn];
char c[maxn];
set<int> row,col;
set<int>:: iterator it;

int main()
{       
    int w, h, n, maxr, maxc;
    while(~scanf("%d%d%d", &w, &h, &n))
    {
        maxr = maxc = 0;
        row.clear();col.clear();
        row.insert(0);row.insert(h);
        col.insert(0);col.insert(w);
        for(int i =0 ;i < n;i++){
            scanf("%*c%c%d", &c[i], &x[i]);
            if(c[i] == 'H') row.insert(x[i]);
            else col.insert(x[i]);
        }
        int l, r;
        for(it = row.begin();it != row.end();){ 
            l = *it;
            it++;
            r = *it;
            maxr = max(maxr, r-l);
        }
        for(it = col.begin();it != col.end();){ 
            l = *it;
            it++;
            r = *it;                  
            maxc = max(maxc, r-l);
        }
        for(int i = n-1;i >= 0;i--){
            ans[i] = 1LL*maxr*maxc;
            if(c[i] == 'H'){
                it = row.lower_bound(x[i]);
                it--;
                l = *it;
                it++;it++;
                r = *it;
                maxr = max(maxr, r-l);
                row.erase(x[i]);
            }
            else{
                it = col.lower_bound(x[i]);
                it--;
                l = *it;
                it++;it++;
                r = *it;
                maxc = max(maxc, r-l);
                col.erase(x[i]);
            }
        }
        for(int i = 0;i < n;i++) 
            printf("%lld
", ans[i]);           
    }
    return 0;
}