hud 6406 （线段树维护区间最长上升子序列）

最新推荐文章于 2020-05-16 10:29:26 发布

_leon1999

最新推荐文章于 2020-05-16 10:29:26 发布

阅读量1.4k

点赞数

分类专栏：杭电训练赛线段树

本文链接：https://blog.csdn.net/weixin_40894017/article/details/81901823

版权

给定一棵苹果树，秋天时上面有n个苹果成熟，Taotao按顺序采摘苹果，只会采摘比之前采摘的苹果高的苹果。本题要求在不同高度的情景下，计算Taotao能采摘到的苹果数量。使用线段树解决区间最长上升子序列问题，同时支持区间修改。参考洛谷P4198楼房重建解题。

摘要由CSDN通过智能技术生成

Taotao Picks Apples

Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 2125 Accepted Submission(s): 679

Problem Description

There is an apple tree in front of Taotao's house. When autumn comes, n apples on the tree ripen, and Taotao will go to pick these apples.

When Taotao picks apples, Taotao scans these apples from the first one to the last one. If the current apple is the first apple, or it is strictly higher than the previously picked one, then Taotao will pick this apple; otherwise, he will not pick.

Given the heights of these apples h1,h2,⋯,hn, you are required to answer some independent queries. Each query is two integers p,q, which asks the number of apples T