diff options
| author | nosyrev <nosyrev@yandex-team.ru> | 2022-02-10 16:49:26 +0300 |
|---|---|---|
| committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:49:26 +0300 |
| commit | a34560e505da5142d686ed3f02c4651058d032c8 (patch) | |
| tree | 5d5cb817648f650d76cf1076100726fd9b8448e8 /library/cpp/lcs | |
| parent | e1d79fa17b770f65538cb8c3d9a5a59ebb0da04b (diff) | |
| download | ydb-a34560e505da5142d686ed3f02c4651058d032c8.tar.gz | |
Restoring authorship annotation for <nosyrev@yandex-team.ru>. Commit 2 of 2.
Diffstat (limited to 'library/cpp/lcs')
| -rw-r--r-- | library/cpp/lcs/README.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/library/cpp/lcs/README.md b/library/cpp/lcs/README.md index c3b77d1820..7ed3d946d6 100644 --- a/library/cpp/lcs/README.md +++ b/library/cpp/lcs/README.md @@ -28,6 +28,6 @@ The idea of the algorithm for constructing DS: - Going along the original sequence, for the current member x in the list of its DS we find the leftmost, such that its last term is not less than x. - If there is one, then add x to the end. - If not, add a new DS consisting of x to the DS list. - + It can be shown that the DS list constructed this way will be SC. |