diff options
| author | Paul Jungeblut <paul.jungeblut@gmail.com> | 2018-01-02 21:55:53 +0100 |
|---|---|---|
| committer | Paul Jungeblut <paul.jungeblut@gmail.com> | 2018-01-02 21:55:53 +0100 |
| commit | 8054fd7ddbd9533505bc2ced3f6e7f979dca9fb1 (patch) | |
| tree | b94e948cd1e5f999e35cc5db453eae700285de23 | |
| parent | 6a1f848405bf1084a21222e0515c7b461c588845 (diff) | |
Removing old RMQ code.
| -rw-r--r-- | datastructures/RMQ.cpp | 20 |
1 files changed, 0 insertions, 20 deletions
diff --git a/datastructures/RMQ.cpp b/datastructures/RMQ.cpp deleted file mode 100644 index 0eed967..0000000 --- a/datastructures/RMQ.cpp +++ /dev/null @@ -1,20 +0,0 @@ -vector<int> data(RMQ_SIZE); -vector<vector<int>> rmq(floor(log2(RMQ_SIZE))+1, vector<int>(RMQ_SIZE)); - -// Baut Struktur auf. O(n*log(n)) -void initRMQ() { - for(int i = 0, s = 1, ss = 1; s <= RMQ_SIZE; ss=s, s*=2, i++) { - for(int l = 0; l + s <= RMQ_SIZE; l++) { - if(i == 0) rmq[0][l] = l; - else { - int r = l + ss; - rmq[i][l] = (data[rmq[i-1][l]] <= data[rmq[i-1][r]]) ? - rmq[i-1][l] : rmq[i-1][r]; -}}}} - -// Gibt den Index des Minimums im Intervall [l,r) zurück. O(1). -int queryRMQ(int l, int r) { - if(l >= r) return l; - int s = floor(log2(r-l)); r = r - (1 << s); - return (data[rmq[s][l]] <= data[rmq[s][r]] ? rmq[s][l] : rmq[s][r]); -} |
