摘要：按照题解1的解法 include include include include include include include include include include include include include include include include include using 阅读全文

摘要："论文地址" "论文视频" 左侧边栏可以导入数据，或者打开以及前保存的结果。右侧显示了所有的日志，可以轻松回到之前的状态，视图的主区域上半部分是数据，下半部分是聚类视图。 INTRODUCTION 数据聚类对于处理无标签数据，高维数据是非常有效的工具。聚类算法中如何确定最好的聚类方法和参数比较困难， 阅读全文

摘要：从(1,1,n,n)每次只变一个坐标，进行询问。 如果问到对角线有距离限制， 再从(1,1,n/2,n/2)询问到(n/2,n/2,n,n) 记住前半部分贪心忘上走，后本部分贪心往右走 因为最后的路线可能有多条 所以这样走的话一定能找到一条对角线在右上角的路线 c++ include include 阅读全文

摘要：从最大的数开始讨论 如果最大的数中间有断开的地方，那么就需要从0里面选，把他填上 需要使用树状数组 include include include include include include include include include include include include incl 阅读全文

摘要：二分答案 然后前缀和+树状数组来判断这个答案是否大于等于数 如果我们对于一个查询，如果小于这个数令为1，大于这个数领为 1 将所有前缀和放在树状数组中，就可以查询所有sum_{l} include include include include include include include inc 阅读全文