ACM交流帖

这个讲义不错： http://wenku.baidu.com/link?url=cOZl5gOfcSd1OXDhQmM-je3MjGxFtSYyPCr1Rmsv-7SnIA7Dvftb7xmgfGPnfgIAl7x3O0CnSdy2bHuNUVwteQxFkfIUbRTbs8Yeq1d5_NG 代码： #include #include #include #include #

代码: #include #include #include #include #include #include #define ll long long #define maxn 2200 #define maxm 301000 using namespace std; int now[maxn]; long long v[maxm]; int st[maxm],ed[maxm

SCUD Busters Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 1154   Accepted: 460 Description Some problems are difficult to solve but have a simplification

存模板:(坐标排序) #include #include #include #include #include #include #include #define LL long long #define pi 3.1415926535898 using namespace std; int n,m; template struct point{

#include #include #include #include #include #include #include #define inf 0x7fffffff #define exp 1e-10 #define PI 3.141592654 using namespace std; const int MAXN=31110; struct Point { double x,y;

传送门:http://blog.youkuaiyun.com/ACMaker     http://www.cnblogs.com/Booble/archive/2011/04/03/2004865.html           http://www.cnblogs.com/DreamUp/archive/2010/09/16/1828131.html           POJ 1

时间：3000ms左右，尚未找到更优的解法或者较为强力的优化 改进目标:1000ms左右 #include #include #include #include #include #include #include #include #define maxn 3002 #define maxm 8000020 using namespace std; inline void r

#include #include #include #include #include #include #include #define maxn 600000 #define maxm 1200000 #define maxq 600000 using namespace std; inline void read(int &x) { char ch; bool

#include #include #include #include #include #include #define ll long long #define MAXN 1000090 using namespace std; int su[MAXN/6],tot; long long f[MAXN],sum[MAXN]; int main(){

用treap记录前缀哈希值，二分求最大值 #include<bits/stdc++.h> using namespace std; #define maxn 100005 ////////////////////////////////////////////// const int P1=1e7+7; const int B1=194317; int Pow1[ 110000...