ABC166E This Message Will Self-Destruct in 5s 题解

E - This Message Will Self-Destruct in 5s (atcoder.jp)

题意

给出数组，从数组中找到满足 q [ i ] + q [ j ] = j - i 的 i 和 j 

思路:  转换之后就变成 q[i]+i=j-q[j]  用map存储

代码

#include<iostream>
using namespace std;
#define ll long long
const ll N=5e5+10;
ll p[N],q[N][2];


int main()
{
	ll n;
	cin>>n;
	for(ll i=1;i<=n;i++)
	{
		cin>>p[i];
		if(i-p[i]>=0)q[i-p[i]][1]++;
		if(i+p[i]<=n)q[i+p[i]][0]++;
	}
	ll ans=0;
	for(int i=1;i<=n;i++)
	{
		if(i-p[i]>=0)ans+=q[i-p[i]][0];
		if(i+p[i]<=n)ans+=q[i+p[i]][1];
	}
	cout<<ans/2<<endl;
	return 0;
}