sky123博客

题目链接 Prof. Pang enters a trap room in a dungeon. The room can be represented by an nnn by mmm chessboard. We use (i,j)(i, j)(i,j) (1≤i≤n1\le i\le n1≤i≤n, 1≤j≤m1\le j\le m1≤j≤m) to denote the cell at the iii-th row and jjj-th column. Every second, the floor

题目链接 You are given a set of strings SSS. Each string consists of lowercase Latin letters. For each string in this set, you want to calculate the minimum number of seconds required to type this string. To type a string, you have to start with an empty strin

题目链接 You are given an array aaa consisting of nnn integers. Let min⁡(l,r)\min(l,r)min(l,r) be the minimum value among al,al+1,…,ara_l, a_{l + 1}, \ldots, a_ral​,al+1​,…,ar​ and max⁡(l,r)\max(l,r)max(l,r) be the maximum value among al,al+1,…,ara_l, a_{l + 1

题目链接 There are nnn beautiful skyscrapers in New York, the height of the iii-th one is hih_ihi​. Today some villains have set on fire first n−1n−1n−1 of them, and now the only safety building is nnn-th skyscraper. Let’s call a jump from iii-th skyscraper to