V
主页
Codeforces Round 864 (Div. 2)
发布人
A. 把其中一个围起来 B. 求出最少修改多少次,n 是奇数时中间的可以随意改,否则需要奇偶性相同 C. 询问 (1,1), (n,m),交集有三种情况,要么是一行,要么是一列,要么是至多两个格子,再问一次就能问出来 D. 模拟,用 set 维护子树 E. 线段树,每个结点维护最大可能的值和总修改次数 F. 用笛卡尔树(也可以认为是 Kruskal 重构树)分别求出满足其中一个条件的路径数,然后在一棵树上 DFS,另一棵树维护 DFS 序,减掉重复的部分。操作在一棵树上就是加叶子,另一棵树上就是加一个根,很容易维护
打开封面
下载高清视频
观看高清视频
视频下载器
Codeforces Round 860 (Div. 2)
Codeforces Round #823 (Div. 2)
Codeforces Round 894 (Div. 3)
Codeforces Round 888 (Div. 3)
Codeforces Round 865 (Div. 1)
Codeforces Round #843 (Div. 2)
Educational Codeforces Round 149 (Rated for Div. 2)
Codeforces Round 937 (Div. 4)
Educational Codeforces Round 141
Codeforces Round 872 (Div. 1)
Codeforces Round 856 (Div. 2)
Codeforces Round #847 (Div. 3)
Codeforces Round #826 (Div. 3)
Educational Codeforces Round 124 丢人现场
Codeforces Round 900 (Div. 3)
Codeforces Round 953 (Div. 2)(A ~ F 题讲解)
Codeforces Round #849 (Div. 4)
Codeforces Round 885 (Div. 2)
膜拜!清华大佬竟把C++讲的如此通俗易懂!(2024版)草履虫都能听懂!这么好的课程还没人看?我不更!!
Codeforces Round #772 (Div. 2), Rank 11
Codeforces Round #855 (Div. 3)
CodeTON Round 1, Rank 1
Codeforces Round 932 (Div. 2)
Codeforces Round 929 (Div. 3)
Codeforces Round #765 (Div. 2) Virtual Participation
Educational Codeforces Round 167 (Rated for Div. 2)
Codeforces Round #854 by cybercats (Div. 1 + Div. 2)
Codeforces Round #838 (Div. 2)
Codeforces Round 950 (Div. 3)
Codeforces Round 955 (Div. 2)(A ~ F 题讲解)
Pinely Round 2 (Div. 1 + Div. 2)
【全684集】清华大佬终于把C语言做成动画片了,通俗易懂,2024最新版,学完即就业!拿走不谢~
Codeforces Round #783 (Div. 1)
Codeforces Round 873 (Div. 1)
Educational Codeforces Round 137
Codeforces Round #851 (Div. 2)
Codeforces Round 952 (Div. 4)
Educational Codeforces Round 140
Codeforces Round 891 (Div. 3)
Codeforces Round 899 (Div. 2)