摘要: http://poj.org/problem?id=1195 1 #include 2 #include 3 #include 4 #define maxn 1026 5 using namespace std; 6 7 int a[maxn][maxn]; 8 int c[maxn][maxn]; 9 int S,x,y,aa,l,r,b,t,h,T;10 11 int lowbit(int x)12 {13 return x&(x^(x-1));14 }15 16 void update(int i,int j,int k)17 {18 while(i0)34 ... 阅读全文
posted @ 2014-02-11 16:11 null1019 阅读(172) 评论(0) 推荐(0)
摘要: http://poj.org/problem?id=2886 1 #include 2 #include 3 #include 4 #define maxn 500100 5 using namespace std; 6 7 typedef long long ll; 8 const int prime[16]= {1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47}; 9 int n,k;10 struct node11 {12 int l,r,num;13 } tree[maxn*3];14 15 ll maxsum,bestnum;16 ... 阅读全文
posted @ 2014-02-11 10:46 null1019 阅读(203) 评论(0) 推荐(0)