RMQ，zkw式線段樹
詳情請去搜尋 "統計的力量"以下是 100 - The 3n+1 problem#include <stdio.h>#define max(x, y) ((x) > (y) ? (x) : (y))#define swap(x, y) {int tmp; tmp = x, x = y, y = tmp;}#define N 1000000#define node 1048576int A[node], tree[node<<1], M;void setTree(int s, int t) {&nb...
