Roadside Trees

题意翻译

在$ 1∼n $ 的位置能种树，刚开始能种树。 第$ i $ 个时刻会有操作： 1.在一个没种过树的位置$ p_i $ 种一颗高度为$ h_i $ 的树。 2.砍掉第$ x_i $ 棵树，保证这个位置以后不会种树。 每天树会长高1 每执行一次操作，输出最长上升子序列长度 任意时刻树的高度不同 Translated by@Fheiwn

题目描述

Squirrel Liss loves nuts. Liss asks you to plant some nut trees. There are $ n $ positions (numbered 1 to $ n $ from west to east) to plant a tree along a street. Trees grow one meter per month. At the beginning of each month you should process one query. The query is one of the following types: 1. Plant a tree of height $ h $ at position $ p $ . 2. Cut down the $ x $ -th existent (not cut) tree from the west (where $ x $ is 1-indexed). When we cut the tree it drops down and takes all the available place at the position where it has stood. So no tree can be planted at this position anymore. After processing each query, you should print the length of the longest increasing subsequence. A subset of existent trees is called an increasing subsequence if the height of the trees in the set is strictly increasing from west to east (for example, the westmost tree in the set must be the shortest in the set). The length of the increasing subsequence is the number of trees in it. Note that Liss don't like the trees with the same heights, so it is guaranteed that at any time no two trees have the exactly same heights.

输入输出格式

输入格式

The first line contains two integers: $ n $ and $ m $ ( $ 1<=n<=10^{5}; 1<=m<=2·10^{5} $ ) — the number of positions and the number of queries. Next $ m $ lines contains the information of queries by following formats: - If the $ i $ -th query is type 1, the $ i $ -th line contains three integers: 1, $ p_{i} $ , and $ h_{i} $ ( $ 1<=p_{i}<=n,1<=h_{i}<=10 $ ), where $ p_{i} $ is the position of the new tree and $ h_{i} $ is the initial height of the new tree. - If the $ i $ -th query is type 2, the $ i $ -th line contains two integers: 2 and $ x_{i} $ ( $ 1<=x_{i}<=10 $ ), where the $ x_{i} $ is the index of the tree we want to cut. The input is guaranteed to be correct, i.e., - For type 1 queries, $ p_{i} $ will be pairwise distinct. - For type 2 queries, $ x_{i} $ will be less than or equal to the current number of trees. - At any time no two trees have the exactly same heights. In each line integers are separated by single spaces.

输出格式

Print $ m $ integers — the length of the longest increasing subsequence after each query. Separate the numbers by whitespaces.

输入输出样例

输入样例 #1

4 6
1 1 1
1 4 4
1 3 4
2 2
1 2 8
2 3

输出样例 #1

1
2
3
2
2
2

说明

States of street after each query you can see on the following animation: If your browser doesn't support animation png, please see the gif version here: http://212.193.37.254/codeforces/images/162/roadtree.gif

题意翻译

在$ 1∼n $ 的位置能种树，刚开始能种树。 第$ i $ 个时刻会有操作： 1.在一个没种过树的位置$ p_i $ 种一颗高度为$ h_i $ 的树。 2.砍掉第$ x_i $ 棵树，保证这个位置以后不会种树。 每天树会长高1 每执行一次操作，输出最长上升子序列长度 任意时刻树的高度不同 Translated by@Fheiwn