POJ 2352 解题报告

/*
ID: thestor1
LANG: C++
TASK: poj2352
*/
#include <iostream>
#include <fstream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <limits>
#include <string>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <algorithm>
#include <cassert>

using namespace std;

const int MAXM = 32000;

int query(std::vector<int> &segmentTree, int left, int right, int index, const int x)
{
if (left > x)
{
return 0;
}

if (right <= x)
{
return segmentTree[index];
}

int mid = left + ((right - left) >> 1);
return query(segmentTree, left, mid, 2 * index + 1, x) + query(segmentTree, mid + 1, right, 2 * index + 2, x);
}

void update(std::vector<int> &segmentTree, int left, int right, int index, const int x)
{
if (left > x || right < x)
{
return;
}

segmentTree[index]++;

if (left != right)
{
int mid = left + ((right - left) >> 1);
update(segmentTree, left, mid, 2 * index + 1, x);
update(segmentTree, mid + 1, right, 2 * index + 2, x);
}
}

int main()
{
std::ios::sync_with_stdio(false);
int N;
cin >> N;
std::vector<int> segmentTree(4 * MAXM, 0);
std::vector<int> cnt(N, 0);
for (int i = 0; i < N; ++i)
{
int x, y;
cin >> x >> y;
int pos = query(segmentTree, 0, MAXM, 0, x);
assert (0 <= pos && pos <= N - 1);
cnt[pos]++;
update(segmentTree, 0, MAXM, 0, x);
}
for (int i = 0; i < N; ++i)
{
cout << cnt[i] << endl;
}
return 0;
}