Warsaw University Contest Petrozavodsk, Thursday, January 31, 2008 F题，Gym100096F
摘要：
题目分析： 集合双Hash 阅读全文
posted @ 2017-08-11 01:04 poler 阅读(170) 评论(0) 推荐(0) 编辑
Warsaw University Contest Petrozavodsk, Thursday, January 31, 2008 A题，Gym100096A
摘要：
Problem A. Athletic competition Input file: athletic.in Output file: athletic.out Elections are coming and the mayor of Bytetown decided to organize a 阅读全文
posted @ 2017-08-11 00:13 poler 阅读(119) 评论(0) 推荐(0) 编辑
Warsaw University Contest Petrozavodsk, Thursday, January 31, 2008 D题，Gym100096D
摘要：
Problem D. Guessing game Input file: game.in Output file: game.out Byteman is playing a following game with Bitman. Bitman writes down some 1 000 000 阅读全文
posted @ 2017-08-11 00:07 poler 阅读(196) 评论(0) 推荐(0) 编辑
Warsaw University Contest Petrozavodsk, Thursday, January 31, 2008 J题,Gym100096J
摘要：
Problem J. Sum of a subsequence Input file: sum.in Output file: sum.out We are given a sequence a1, a2, . . . , a2n. Your task is to find a subsequenc 阅读全文
posted @ 2017-08-10 23:39 poler 阅读(144) 评论(0) 推荐(0) 编辑
留坑待填
摘要：
HDU 6069 线性筛 数论 hdu 1839 hdu 3873 hdu 3966 阅读全文
posted @ 2017-08-04 22:31 poler 阅读(106) 评论(0) 推荐(0) 编辑
FZU2282--错排公式
摘要：
http://acm.fzu.edu.cn/problem.php?pid=2282 F[i]=(i-1)(F[i-2]+F[i-1]) 阅读全文
posted @ 2017-08-04 20:07 poler 阅读(175) 评论(0) 推荐(0) 编辑
POJ 3468 区间加减 区间求和
摘要：
1 #include 2 #include 3 #include 4 #include 5 #define lson l,m,rt>1)); 21 sum[rt>1); 22 add[rt]=0; 23 } 24 } 25 void build(int l,int r,int rt){ 26 add[rt]=0; 27 i... 阅读全文
posted @ 2017-08-03 19:09 poler 阅读(282) 评论(0) 推荐(0) 编辑
HDU 1556 树状数组
摘要：
1 #include 2 #define maxn 100010 3 using namespace std; 4 int C[maxn],n,m; 5 inline int lowbit(int x){ return (x&-x);} 6 inline void update(int x,int d){ 7 while(x0){ 15 res+=C[x];... 阅读全文
posted @ 2017-08-02 20:34 poler 阅读(126) 评论(0) 推荐(0) 编辑
HDU 5480 树状数组
摘要：
1 #include 2 #define maxn 100100 3 using namespace std; 4 int row[maxn],col[maxn],K,n,m,Q,x1,x2,yy1,y2; 5 bool vis[maxn][3]; 6 inline int lowbit(int x){ return (x&-x);} 7 inline void update(in... 阅读全文
posted @ 2017-08-02 20:25 poler 阅读(131) 评论(0) 推荐(0) 编辑
