摘要： http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binaryIndexedTreesFinishhttp://community.topcoder.com/tc?module=Static&d1=tutorials&d2=binarySearchFinishthinking:我一直以为自己已经精通二分，然后现在才发现自己根本没有深入，读罢此文，做了2次测试，然后果断又添加了点东西去“二分总结”http://community.topcoder.com/tc?module=Static& 阅读全文

摘要： #include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<string>#include<queue>using namespace std;#define N 10005#define LL long longint c[N],a[3000005];int sum(int x){ int ret=0; while(x) { ret+=c[x]; x-=x&-x; } ret 阅读全文