wengshijin

摘要： 树状数组# include <stdlib.h># include <stdio.h> int c[10001]; int lowbite(int x); int n;int main () { int sum(int i); void add(int i); long m,i,j,k,min=99999999,mink; int a[10001]; scanf("%d%d",&n,&k);for (i=1;i<=k;i++) { for (j=1;j<=n;j++) c[j]=0; m=0; for (j=1;j< 阅读全文