2019湖北省赛网络赛C Store CDQ分治

最新推荐文章于 2022-05-22 09:29:56 发布

Monster_ixx

最新推荐文章于 2022-05-22 09:29:56 发布

阅读量243

点赞数

分类专栏：杂题文章标签： c cdq分治 acm

本文链接：https://blog.csdn.net/Monster_ixx/article/details/89076795

版权

本文详细解析了2019湖北省赛网络赛中的一道题目，该题目涉及商店销售记录的管理。题目要求根据特定的操作类型查询产品信息，通过CDQ分治策略解决二维偏序问题。文章介绍了CDQ分治的思想，如何维护递增序列，并使用集合(set)处理查询操作，同时给出了复杂度分析和AC代码。

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

Ichuan is a store owner and his store has n products, numbered from 1 to ?.

Recently, his business is not very good, and he can occasionally sell a product, so he will confirm the information of the products sold.

???，it means that on the ??ℎ day, the product numbered ? is sold.

???，in currently sold products, those whose number is greater than or equal to ?, which one is the lowest number which sold before the ??ℎ day (including ??ℎ day) .

Input
the first line contains two positive integers ?，?（2≤?,?≤200000），which are the number of products and operations.

The following Q lines, each line contains one operator character (? or ?) and two integers ?,?.(1≤?≤109,1≤?≤?)

Output
For each request of type ???，output the number of required product. If no such product exists, output −1.
Examples
input

output

3
1

input

output

感觉这个题意写的不是很明确，感感觉改成在每次操作M后第x天发现了一笔y的订单，然后D操作是查询已经发现的订单中订购时间在第x天之前的编号大于等于y的最小编号。

题意感觉就是个二维偏序问题，因此cdq分治可做。

cdq分治的过程中我们维护x为递增序列，然后用set维护y，每次为W操作的时候加入set，D操作的时候更新答案。

复杂度： $O(nlog^2n)$

AC代码

#include<bits/stdc++.h>
using namespace std;
const int N=2e5+5;
const int inf=0x3f3f3f3f;
struct node{
   
    int op,x,y,id;
    node(){
   }
    node(int op,int x,int y,int id