zhaorongxia的专栏

数据量比较大，所以要用线段树处理！！在加以个数后，不要把父结点的所有子结点都加上，这要比较费时间，用一个nsum存储，在寻找区间段的和时，按需要往下加！！另外数据位数比较大，超过了32位，用int类型肯定不行，要用__int64！！具体看代码的注释！！DescriptionYou have N integers, A1, A2, ... ,AN. You need to dea

这道题用线段树做，记录不同区间的的最大最小值，在搜索时从大区间开始搜索，具体看代码的注释！DescriptionFor the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One day Farmer John decides to organize a

用二分图做，把牛看作一个集合，把牛棚看作另一个集合，求最大产奶量就是求最大匹配数！！！DescriptionFarmer John completed his new barn just last week, complete with all the latest milking technology. Unfortunately, due to engineering proble