2019杭电暑假多校训练营(第六场)
bootdubbo
这个作者很懒,什么都没留下…
展开
-
HDU-6638 Snowy Smile【子矩阵最大和】
Problem DescriptionThere are n pirate chests buried in Byteland, labeled by 1,2,…,n. The i-th chest’s location is (xi,yi), and its value is wi, wi can be negative since the pirate can add some poison...原创 2019-08-15 10:26:03 · 239 阅读 · 0 评论 -
TDL
Problem DescriptionFor a positive integer n, let’s denote function f(n,m) as the m-th smallest integer x that x>n and gcd(x,n)=1. For example, f(5,1)=6 and f(5,5)=11.You are given the value of m ...原创 2019-08-25 22:55:32 · 207 阅读 · 0 评论 -
Stay Real
Problem DescriptionIn computer science, a heap is a specialized tree-based data structure which is essentially an almost complete tree that satisfies the heap property: in a min heap, for any given n...原创 2019-08-25 23:05:39 · 132 阅读 · 0 评论 -
Nonsense Time【LIS路径】
Problem DescriptionYou a given a permutation p1,p2,…,pn of size n. Initially, all elements in p are frozen. There will be n stages that these elements will become available one by one. On stage i, th...原创 2019-08-26 11:47:03 · 206 阅读 · 0 评论