C++ #include #include #define MINIMUM_POWER_OF_2_GREATER_THAN_MAXIMUM_N 131072 int T[MINIMUM_POWER_OF_2_GREATER_THAN_MAXIMUM_N*2]; int M = 1; void init(int N) { while (M 0) { T[index] += delta; index /= 2; } } int sum(int left, int right) { left = left + M - 1; right = right + M - 1; int sum = 0; while (..
인덱스 트리
C++ #include #include #define MINIMUM_POWER_OF_2_GREATER_THAN_MAXIMUM_N 131072 int T[MINIMUM_POWER_OF_2_GREATER_THAN_MAXIMUM_N*2]; int M = 1; void init(int N) { while (M 0) { T[index] += delta; index /= 2; } } int sum(int left, int right) { left = left + M - 1; right = right + M - 1; int sum = 0; while (..
2019.06.20