Longest common subsequence: Difference between revisions
Content deleted Content added
m changed l/r to match scs task (same output) |
The reverse iterator it2 now visits index2 values in descending order. |
||
Line 389:
auto dq2 = *it1;
auto limit = threshold.end();
for (auto it2 = dq2.
// Each of the index1, index2 pairs considered here correspond to a match
auto index2 = *it2;
//
// Note: The
// allowing thresholds to be updated in-place.
//
//
limit = lower_bound(threshold.begin(), limit, index2);
Line 410:
// divided by factors ranging from 2 up to 10 or more.
//
auto skip = next(it2) != dq2.
(limit == threshold.begin() || *prev(limit) < *next(it2));
if (skip) continue;
Line 463:
uint32_t index = 0;
for (const auto& it : s2)
indexes[it].
for (const auto& it : s1) {
| |||