Loading

摘要: Problem Description Let’s call a weighted connected undirected graph of n vertices and m edges KD-Graph, if the following conditions fulfill: * n vert 阅读全文
posted @ 2021-07-20 21:01 脂环 阅读(490) 评论(4) 推荐(2) 编辑
摘要: Problem Description Given n-1 points, numbered from 2 to n, the edge weight between the two points a and b is lcm(a, b). Please find the minimum spann 阅读全文
posted @ 2021-07-20 18:36 脂环 阅读(487) 评论(0) 推荐(0) 编辑
摘要: Problem Description Given a matrix of n rows and m columns,find the largest area submatrix which is non decreasing on each column Input The first line 阅读全文
posted @ 2021-07-20 18:29 脂环 阅读(159) 评论(2) 推荐(0) 编辑
摘要: 链接:https://ac.nowcoder.com/acm/contest/11253/K 来源:牛客网 题目描述 ZYT had a magic permutation a1,a2,⋯ ,ana1,a2,⋯,an, and he constructed a sequence b1,b2,⋯bnb 阅读全文
posted @ 2021-07-20 10:53 脂环 阅读(168) 评论(0) 推荐(0) 编辑