题目链接
现在有一个序列 ?1, ?2, ..., ??a1, a2, ..., an ,还有m个查询 ??, ?? (1 ≤ ?? ≤ ?? ≤ ?)lj, rj (1 ≤ lj ≤ rj ≤ n) 。对于每一个查询,请找出距离最近的两个元素 ??ax 和 ?? (? ≠ ?)ay (x ≠ y) ,并且满足以下条件:
?? ≤ ?, ? ≤ ??;lj ≤ x, y ≤ rj;
?? = ??。ax = ay。
两个数字的距离是他们下标之差的绝对值 |? − ?||x − y| 。
收起
输入
单组测试数据。 第一行有两个整数n, m (1≤n,m≤5*10^5),表示序列的长度和查询的次数。 第二行有n个整数a1,a2,...,an (-10^9≤ai≤10^9)。 接下来有m行,每一行给出两个整数lj,rj (1≤lj≤rj≤n)表示一个查询。
输出
对于每一个查询,输出最近的距离,如果没有相等的元素,输出-1。
用线段树维护贡献,贡献存放到先出现的点上去,然后会发现TLE!
增加个快速读入的优化即可。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
namespace fastIO {
#define BUF_SIZE 100000
//fread -> read
bool IOerror = 0;
inline char nc() {
static char buf[BUF_SIZE], *p1 = buf + BUF_SIZE, *pend = buf + BUF_SIZE;
if(p1 == pend) {
p1 = buf;
pend = buf + fread(buf, 1, BUF_SIZE, stdin);
if(pend == p1) {
IOerror = 1;
return -1;
}
}
return *p1++;
}
inline bool blank(char ch) {
return ch == ' ' || ch == '\n' || ch == '\r' || ch == '\t';
}
inline void read(int &x) {
char ch;
while(blank(ch = nc()));
if(IOerror) return;
for(x = ch - '0'; (ch = nc()) >= '0' && ch <= '9'; x = x * 10 + ch - '0');
}
#undef BUF_SIZE
};
using namespace fastIO;
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 1e6 + 7;
int N, M, pre[maxN], ans[maxN];
map<int, int> mp;
struct node
{
int type, val, x, id;
node(int a=0, int b=0, int c=0, int d=0):type(a), val(b), x(c), id(d) {}
friend bool operator < (node e1, node e2) { return e1.x < e2.x; }
}q[maxN];
int tree[maxN<<2];
void buildTree(int rt, int l, int r)
{
tree[rt] = INF;
if(l == r) return;
int mid = HalF;
buildTree(Lson); buildTree(Rson);
}
inline void pushup(int rt) { tree[rt] = min(tree[lsn], tree[rsn]); }
inline void update(int rt, int l, int r, int qx, int val)
{
if(l == r) { tree[rt] = val; return; }
int mid = HalF;
if(qx <= mid) update(Lson, qx, val);
else update(Rson, qx, val);
pushup(rt);
}
inline int query(int rt, int l, int r, int ql, int qr)
{
if(tree[rt] == INF) return tree[rt];
if(ql <=l && qr >= r) return tree[rt];
int mid = HalF;
if(qr <= mid) return query(QL);
else if(ql > mid) return query(QR);
else return min(query(QL), query(QR));
}
int main()
{
// scanf("%d%d", &N, &M);
read(N); read(M);
for(int i=1, v; i<=N; i++)
{
// scanf("%d", &v);
read(v);
// q[i] = node(1, v, i);
pre[i] = mp[v];
mp[v] = i;
}
for(int i=1, ql, qr; i<=M; i++)
{
// scanf("%d%d", &ql, &qr);
read(ql); read(qr);
// q[N + i] = node(0, ql, qr, i);
q[i] = node(0, ql, qr, i);
}
// sort(q + 1, q + N + M + 1);
sort(q + 1, q + M + 1);
buildTree(1, 1, N);
int now_r = 1, tmp;
for(int i=1; i<=M; i++)
{
while(now_r <= q[i].x)
{
if(pre[now_r]) update(1, 1, N, pre[now_r], now_r - pre[now_r]);
now_r++;
}
tmp = query(1, 1, N, q[i].val, q[i].x);
ans[q[i].id] = (tmp == INF ? -1 : tmp);
}
for(int i=1; i<=M; i++) printf("%d\n", ans[i]);
return 0;
}