摘要：
题目链接： G. Hiring time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output time limit per test 4 se 阅读全文
摘要：
1.树状数组在很多情况下可以替代线段树,而且树状数组的代码简洁好写,所以能用树状数组的地方我还是会树状数组而不是线段树; 2.树状数组的常用的函数有以下这些: 3.某些题目的区间修改可以改成点修改,然后区间查询如hdu1556,poj2155(二维的树状数组好神奇); 阅读全文
摘要：
题目链接： Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 23170 Accepted: 8613 Description Given an N*N matrix A, whose elements are eit 阅读全文
摘要：
题目链接： Color the ball Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14781 Accepted Submission(s) 阅读全文
摘要：
题目链接： C. Subsequences time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per test 阅读全文
摘要：
题目链接： D. Pashmak and Parmida's problem Parmida is a clever girl and she wants to participate in Olympiads this year. Of course she wants her partner t 阅读全文
摘要：
题目链接： D. Powerful array An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l 阅读全文
摘要：
2.a&b+a^b=a|b; 3.若a^b=c,则a=c^b;b=a^c; 4.有3可推导出a[i]^a[i+1]^...^a[j]=sum[i-1]^sum[j](sum[i]为a[]的前i的数的异或和); 5.a>>1=a/2;a<<1=a*2; 6.啦啦啦啦啦啦,这些都是最简单最基本的,以后碰 阅读全文
摘要：
题目链接： E. XOR and Favorite Number Bob has a favorite number k and ai of length n. Now he asks you to answer m queries. Each query is given by a pair li 阅读全文
摘要：
题目链接： C. Nearest vectors You are given the set of vectors on the plane, each of them starting at the origin. Your task is to find a pair of vectors wi 阅读全文