https://blog.csdn.net/csyifanZhang/article/details/105632729为了更好的阅读体验↑ 线段树比暴力更加优美，这道题能用暴力完全是出题人给面子了。。。 看评论区大佬都水过了，我也先水一下，复杂度都可以过，可以见得数据之水当然这道题的数据量本身也是符合这个复杂度的， 暴力解法 ps：fill和memset别用得太多，有时候会被卡死 #include<iostream> #include<string> #include<string.h> #include<cstdio> #include&lt...

https://blog.csdn.net/csyifanZhang/article/details/105625010【为了良好的阅读体验，建议到上面】 乍一看直接模拟，暴力递推，索性NK的数据比较水，过起来很容易 #include<iostream> #include<string> #include<string.h> #include<cstdio> #include<algorithm> #include<vector> #include<map> #include<queue> usin...