Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://TheAlgorithms.github.io/C-Plus-Plus/d2/d96/sparse__table__range__queries_8cpp_source.html below:

TheAlgorithms/C++: range_queries/sparse_table_range_queries.cpp Source File

sparse_table {

std::vector<T> computeLogs(

std::vector<T>& A) {

std::vector<T> logs(n);

(

i = 2; i < n; i++) {

logs[i] = logs[i / 2] + 1;

std::vector<std::vector<T> > buildTable(

std::vector<T>& A,

std::vector<T>& logs) {

std::vector<std::vector<T> > table(20, std::vector<T>(n + 5, 0));

(

i = 0; i <= logs[n]; i++) {

(

j = 0; j + curLen < n; j++) {

std::min(table[i - 1][j], table[i - 1][j + curLen / 2]);

getMinimum(

beg,

end,

std::vector<T>& logs,

std::vector<std::vector<T> >& table) {

p = logs[end - beg + 1];

std::min(table[p][beg], table[p][end - pLen + 1]);

std::vector<int> A{1, 2, 0, 3, 9};

std::vector<int> logs = range_queries::sparse_table::computeLogs(A);

std::vector<std::vector<int> > table =

range_queries::sparse_table::buildTable(A, logs);

assert(range_queries::sparse_table::getMinimum(0, 0, logs, table) == 1);

assert(range_queries::sparse_table::getMinimum(0, 4, logs, table) == 0);

assert(range_queries::sparse_table::getMinimum(2, 4, logs, table) == 0);

int main()

Main function.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4