int findMaximum(int A[], int l, int r) {
int m = (l + r) / 2;
if (l == r - 1)
return A[l];
else{
u = findMaximum(A, l, m);
v = findMaximum(A, m, r);
return max(u, v);
}
}
分治法求RMQ
最新推荐文章于 2023-08-14 15:03:20 发布