這點比較奇怪，Splay並不是越平衡效率越高的，有時候恰恰相反。總的來說只有插完了Splay一下就行了，時間複雜度不會變的。

struct edge
{
int v;
edge *next;
edge(int v,edge *next):v(v),next(next) {}
} *e[222];

What is “edge(int v,edge *next):v(v),next(next) {}” for ?

Or what are used for those functions like :

bool operator < (int blabla, int blabla) {}

And can you tell me which algorithms are used most in IOI competitions, which graph, DP, greedy, etc.. algorithms are used ?

Thanks in advance, sorry for bothering you but i want to become better :)