hiho week 21 register

Ended

Participants:248

Verdict:Wrong Answer
Score:40 / 100
Submitted:2014-11-23 16:27:00

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)
using namespace std;
#define N 200000
int a[N*2];
int  h[99999999];
struct stud{
int le,ri;
}post[N];
struct stud1{
int le,ri;
int cover;
}f[N*4];
int cmp(int a,int b)
{
    return a<b;
}
void build(int pos,int le,int ri)
{
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX