![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 int read(){ 2 int x=0,f=1;char ch=getchar(); 3 while(ch<'0' || ch>'9'){if(ch=='-')f=-1;ch=getchar();} 4 while(ch>='0' && ch<='9'){x=x*10+ch-'0';ch=getchar();} 5 return x*f; 6 }
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 inline void write(int x){ 2 if(x<0) putchar('-'),x=-x; 3 if(x>9) write(x/10); 4 putchar(x%10+'0'); 5 }
树:
树链剖分:http://www.cnblogs.com/SilverNebula/p/6025052.html
更完善的树链剖分:
图论:
二分图匹配-匈牙利算法:http://www.cnblogs.com/SilverNebula/p/6031340.html
计算几何:
左转 http://www.cnblogs.com/SilverNebula/p/6740955.html
字符串: