摘要:
3110: [Zjoi2013]K大数查询 Description 有N个位置,M个操作。操作有两种,每次操作如果是1 a b c的形式表示在第a个位置到第b个位置,每个位置加入一个数c如果是2 a b c形式,表示询问从第a个位置到第b个位置,第C大的数是多少。 有N个位置,M个操作。操作有两种, 阅读全文
摘要:
The Company Dynamic Rankings has developed a new kind of computer that is no longer satisfied with the query like to simply find the k-th smallest num 阅读全文
摘要:
Cleaning Time limit : 2sec / Memory limit : 256MB Score : 700 points Problem Statement There is a tree with N vertices, numbered 1 through N. The i-th 阅读全文
摘要:
Boxes Time limit : 2sec / Memory limit : 256MB Score : 500 points Problem Statement There are N boxes arranged in a circle. The i-th box contains Ai s 阅读全文
摘要:
How many integers can you find Time Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description Now you get a num 阅读全文
摘要:
Given a list of integers (A1, A2, ..., An), and a positive integer M, please find the number of positive integers that are not greater than M and divi 阅读全文
摘要:
Visible Trees Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description There are many trees forming a m * 阅读全文
摘要:
GCD Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Problem Description Given 5 integers: a, b, c, d, k, you're to fi 阅读全文