题目链接 | 题解链接 | 难度 | 主要算法 |
---|---|---|---|
A. Two Subsequences | A. Two Subsequences | 800 | |
B. Divine Array | B. Divine Array | 1100 | 暴力 |
C. Array Elimination | C. Array Elimination | 1300 | 思维,枚举 |
D. Frog Traveler | 1900 | ||
E. Optimal Insertion | 2300 | ||
F. Difficult Mountain | 2700 |
Codeforces Round #751(A - C)
最新推荐文章于 2024-06-23 10:36:46 发布