p2380.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int MAXN = 500001;
int id[MAXN];
struct sale{ int q,s,v; };
sale a[MAXN];
bool cmp(sale a,sale b){ return a.s < b.s || a.s == b.s && a.q < b.q; }
int main(){
    int n;
    while(cin >> n){
        for(int i = 0;i < n;++i){
            scanf("%d%d%d",&a[i].q,&a[i].s,&a[i].v);
            id[i] = a[i].q;
        }
        sort(id,id+n);
        vector <int> b;
        printf("-1 %d",id[0]);
        b.push_back(id[0]);
        for(int i = 1;i < n;++i)
            if(id[i] != id[i-1]){
                b.push_back(id[i]);
                printf(" %d",id[i]);
            }
        puts("");
        sort(a,a+n,cmp);
        int i(0);
        while(i < n){
            printf("%d",a[i].s);
            int ts(a[i].s);
            for(int j = 0;j < b.size();++j){
                int sum(0);
                for(;i < n && a[i].s == ts && a[i].q == b[j];++i) sum += a[i].v;
                printf(" %d",sum);
            }
            puts("");
        }
    }
}