Taboo

poj3468#include<stdio.h>#include<string.h>#include<string>#include<math.h>#include<algorithm>#include<iostream>#include<queue>#include<vecto

HihoCoder - 1077#include<stdio.h>#include<string.h>#include<string>#include<math.h>#include<algorithm>#include<iostream>#include<queue>#include&l

hdu 1540 find x的时候找出1-x中被毁坏的最大的点和x-n中被毁坏的最小的点，然后必须加上优化，不然要TEL，这里给出两种方法。方法一//#include <bits/stdc++.h>#include<stdio.h>#include<string.h>#include<string>#include<m...

地址树链剖分//#include <bits/stdc++.h>#include<stdio.h>#include<string.h>#include<string>#include<math.h>#include<algorithm>#include<iostream>#include&

poj 1151#include<stdio.h>#include<string.h>#include<string>#include<math.h>#include<algorithm>#include<iostream>#include<queue>#include<vector