lqybzx的专栏

DescriptionInputOutputSample Input4 25 35 15 4540 20 10 30Sample Output4HINT学姐走好_(:з」∠)_容斥+DPf[i][j]表示前i个有j对大于药片。剩下i-j对情况随意的种数f[i][j]=f[

Problem DescriptionZhu found a map which is a N∗M rectangular grid.Each cell has a height and there are no two cells which have the same height. But this map is too old to get the clear informat

Description有一个n行m列的整数矩阵，其中1到nm之间的每个整数恰好出现一次。如果一个格子比所有相邻格子（相邻是指有公共边或公共顶点）都小，我们说这个格子是局部极小值。给出所有局部极小值的位置，你的任务是判断有多少个可能的矩阵。Input输入第一行包含两个整数n和m（1nmn行每行m个字符，其中“X”表示局部极小值，“.”表示非局部极小值。 Out

Problem DescriptionWhen ?? was born, seven crows flew in and stopped beside him. In its childhood, ?? had been unfortunately fall into the sea. While it was dying, seven dolphins arched its body a

Problem DescriptionYou are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions?* 1≤Bi≤Ai* For each pair( l , r ) (1≤l≤r≤n) ,