A. LaIS (CF contest 1468 A) 题目大意 给定数组\(a_{i}\),求最长几乎上升子数组长度。 一个有\(k\)个数的数组\(b_{i}\)如果满足 \[\min(b_{1}, b_{2}) \leq \min(b_{2}, b_{3}) \leq \min ...
目录 Contest Info Solutions A. Berstagram C. Trip to Saint Petersburg E. The Coronation F. Data Center G. Discarding Game H. Happy Birthday J. The Parade L. Divide The Students M. SmartGarden N. Wires ...
2019-11-03 08:18 1 604 推荐指数:
A. LaIS (CF contest 1468 A) 题目大意 给定数组\(a_{i}\),求最长几乎上升子数组长度。 一个有\(k\)个数的数组\(b_{i}\)如果满足 \[\min(b_{1}, b_{2}) \leq \min(b_{2}, b_{3}) \leq \min ...
目录 Contest Info Solutions A. Copying Homework C. Even Path E. Songwriter G. Performance Review H. Twin ...
C. Constructing Ranches 题意: 一棵树上每个节点有权值\(a_i\),问你有多少路径满足以下条件:路径经过的每个点权作为边长,可以构成一个多边形。 解法: 三条边能构成 ...
题解: https://files.cnblogs.com/files/clrs97/19HKEditorial-V1.zip Code:(Part) A. Axis of Symmetr ...
目录 Contest Info Solutions Problem A. Accurate Movement Problem B. Bad Treap Problem E. Equidistant Problem H. High ...
传送门 A. Environment-Friendly Travel 注意到\(N*B\)很小,所以我们利用这个作为状态跑\(dp\)就行。时间复杂度为\(O(10^8)\)左右。 比较套路的\( ...