摘要：
链接：https://ac.nowcoder.com/acm/contest/11255/E 来源：牛客网 题目描述 Bob has a tree with nn nodes and the weight of i-th node is wiwi. But Bob forgot w1...nw1.. 阅读全文
posted @ 2021-07-28 23:10
脂环
阅读(353)
评论(3)
推荐(1)
摘要：
Problem Description Pixels in a digital picture can be represented with three integers (R,G,B) in the range 0 to 255 that indicate the intensity of th 阅读全文
posted @ 2021-07-27 23:36
脂环
阅读(144)
评论(0)
推荐(0)
摘要：
Problem Description Alice and Bob are playing a game. In this game, there are n straight lines on the 2D plane. Alice will select exactly k straight l 阅读全文
posted @ 2021-07-27 23:28
脂环
阅读(144)
评论(0)
推荐(0)
摘要：
Problem Description Chenjb is struggling with data stucture now. He is trying to solve a problem using segment tree. Chenjb is a freshman in programmi 阅读全文
posted @ 2021-07-27 23:16
脂环
阅读(105)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/11255/F 来源：牛客网 题目描述 Alice and Bob are playing a game. At the beginning, there is an undirected graph GG with nn 阅读全文
posted @ 2021-07-26 18:48
脂环
阅读(106)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/11255/I 来源：牛客网 题目描述 For a sequence t1...nt1...n, we define the weight of it is the number of pairs (i,j)(i,j) s 阅读全文
posted @ 2021-07-26 18:42
脂环
阅读(111)
评论(0)
推荐(1)
摘要：
链接：https://ac.nowcoder.com/acm/contest/11255/C 来源：牛客网 题目描述 Let LCS(s1,s2)LCS(s1,s2) denote the length of the longest common subsequence (not necessary 阅读全文
posted @ 2021-07-26 18:41
脂环
阅读(110)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/11255/J 来源：牛客网 题目描述 Bob has an n×mn×m matrix WW. This matrix is very special, It's calculated by two sequences 阅读全文
posted @ 2021-07-26 18:40
脂环
阅读(323)
评论(0)
推荐(0)
摘要：
链接：https://ac.nowcoder.com/acm/contest/11254/B 来源：牛客网 题目描述 Goodeat has a white chessboard with n rows and m columns. Each grid (i, j) has a weight c(i 阅读全文
posted @ 2021-07-25 16:06
脂环
阅读(169)
评论(0)
推荐(0)
摘要：
如果边权不大（1e6以下）的话可以不直接sort而是使用桶排序，开边权范围的vector数组不断往对应的vector里push_back边即可 阅读全文
posted @ 2021-07-25 11:14
脂环
阅读(52)
评论(0)
推荐(0)
浙公网安备 33010602011771号