摘要： IntroductionWe often need some sort of data structure to make our algorithms faster. In this article we will discuss theBinary Indexed Treesstructure. According toPeter M. Fenwick, this structure was first used for data compression. Now it is often used for storing frequencies and manipulating cumul 阅读全文

摘要： Source Code#include <stdio.h>#include <algorithm>using namespace std ;bool visit[65] ,judge ;int len[65] ,min_length ,stick_num ,num ,next[65] ;bool cmp(int a ,int b) { return a > b ;}void init() { judge = false ; sort(len ,len + num ,cmp) ; //从大到小排序 len[num] = -1 ; int pre = len[0] . 阅读全文