题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5, mod = 1e9 + 7, N = 1e6;
int a[maxn], b[maxn], d[maxn];
bool vis[maxn];
int n, m;
string s;
struct Node{int val, id;bool operator<(const Node &u)const{return val < u.val;}
};vector<pair<int, int>> ans;bool work(int flag){ans.clear();for(int i = 1; i <= n; i++){a[i] = b[i];}int mx = 0;int x = 0, y = 0;//最大的正