树状数组
ACMega
精通C/C Java 要饭
展开
-
LA4329 - Ping pong
简单的树状数组#include #include #include #include #include #include #define MAXN 100010using namespace std;int N = MAXN, C[100010], a[20010], _c[20010], _d[20010];int lowbit(int x){ return x &原创 2013-10-24 17:15:04 · 283 阅读 · 0 评论 -
2011 Heilongjiang collegiate programming contest - Problem H - Car race game
求数列逆序数复杂度O(nlogn)的两种算法1. 树状数组,原创 2014-07-30 01:35:04 · 243 阅读 · 0 评论 -
2014 Multi-University Training Contest 5 - HDU4911 - Inversion
逆序数 - k 为结果。逆序数可用离散化加树状数组求得。原创 2014-08-07 11:28:42 · 281 阅读 · 0 评论