SPOJ ADAFIELD Ada and Field（STL的使用：set，multiset，map的迭代器）题解

#include<set>
#include<map>
#include<queue>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int maxn = 20000 + 10;
const int seed = 131;
const int MOD = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
set<ll> x, y;
multiset<ll> lenx, leny;
int main(){
    int T;
    ll n, m, q;
    scanf("%d", &T);
    while(T--){
        scanf("%lld%lld%lld", &n, &m, &q);
        x.clear();
        y.clear();
        lenx.clear();
        leny.clear();
        x.insert(0),x.insert(n),lenx.insert(n);
        y.insert(0),y.insert(m),leny.insert(m);
        set<ll>::iterator it;
        while(q--){
            ll o, p;
            scanf("%lld%lld", &o, &p);
            if(o == 0 && x.count(p) == 0){
                it = x.lower_bound(p);
                lenx.insert(*it - p);
                int len = *it - *(--it);
                lenx.erase(lenx.find(len));
                lenx.insert(p - *it);
                x.insert(p);
            }
            else if(o == 1 && y.count(p) == 0){
                it = y.lower_bound(p);
                leny.insert(*it - p);
                int len = *it - *(--it);
                leny.erase(leny.find(len));
                leny.insert(p - *it);
                y.insert(p);
            }
            it = lenx.end();
            ll chang = *(--it);
            it = leny.end();
            ll kuan = *(--it);
            printf("%lld\n", chang * kuan);
        }
    }
    return 0;
}