Difference between revisions of "Asia Yokohama Regional Contest 2018"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by zerol. 00:33 (+) == Problem B == Solved by ultmaster. 01:09 (+) == Problem C == Solved by zerol. 01:39 (+1) == Problem D == Solved by kblack....") |
|||
| Line 6: | Line 6: | ||
Solved by ultmaster. 01:09 (+) | Solved by ultmaster. 01:09 (+) | ||
| + | |||
| + | 题意：从一个集合里选一些数使得构成等差数列最长。 | ||
| + | |||
| + | 题解：d[i][j] 表示到 i，上一个是 j，最长是多少。转移的时候在一个 map 里反查一下，就是 $O(n^2 \log n)$ 了。 | ||
== Problem C == | == Problem C == | ||
Revision as of 07:45, 2 March 2019
Problem A
Solved by zerol. 00:33 (+)
Problem B
Solved by ultmaster. 01:09 (+)
题意：从一个集合里选一些数使得构成等差数列最长。
题解：d[i][j] 表示到 i，上一个是 j，最长是多少。转移的时候在一个 map 里反查一下，就是 $O(n^2 \log n)$ 了。
Problem C
Solved by zerol. 01:39 (+1)
Problem D
Solved by kblack. 02:34 (+)
Problem E
Unsolved. (-2)
Problem F
Unsolved.
Problem G
Solved by kblack. 02:56 (+)
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Unsolved.