sky_fighting的专栏

敌兵布阵 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17555    Accepted Submission(s): 7660 Problem Description C国的死对头A国这段时间正在进行军事演习

Stars Time Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/65536 K (Java/Others) Total Submission(s): 633    Accepted Submission(s): 269 Problem Description Yifenfei is a romantic

Color the ball Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3937    Accepted Submission(s): 2124 Problem Description N个气球排成一排，从左

Stars Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2250    Accepted Submission(s): 858 Problem Description Astronomers often exa

KiKi's K-Number Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1593    Accepted Submission(s): 677 Problem Description For the k-t

话说这道题要用的三个树状数组，不容易啊。我刚开始想的时候想明白了用公式怎么算，却想不出来怎么转化到树状数组上，总感觉有些地方实现不了，原来竟然是用三个树状数组。。。这让只写过一个树状数组的孩纸情何以堪？           具体来说，有一个num数组，里面记录的是插入a[i]后，在a[i]之前插入且比a[i]小的数的个数；还有一个totalsum数组，记录的是插入第i个数后，前i-1个数的总

Necklace Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1217    Accepted Submission(s): 462 Problem Description Mery has a beauti

Frosh Week Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 999    Accepted Submission(s): 307 Problem Description During Frosh Week

Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4415    Accepted Submission(s): 2656 Problem Description T