【cf 1185 D】 Extra Element

1.题目链接。题目大意：给定一个数组，是否可以删除其中一个元素使其变成等差数列。

2.做法很简单，输入进来之后排序，然后统计相邻两项之差。枚举需要删除的数据，动态修改这个map的值，观察它的size即可。

#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
#define ll long long
ll a[N];
map<ll, int>mp;
map<ll, ll>pos;
#pragma warning(disable:4996)
int main()
{
	int n;
	while (cin >> n)
	{
		for (int i = 1; i <= n; i++)
		{
			scanf("%lld", &a[i]);
			pos[a[i]] = i;
		}
		sort(a + 1, a + 1 + n);
		for (int i = 2; i <= n; i++)
		{
			mp[a[i] - a[i - 1]]++;
		}
	/*	if (mp.size() == 1)
		{
			cout << "1" << endl;
			continue;
		}*/
		int flag = 0;
		map<ll, int>tem = mp;
		for (int i = 1; i <= n; i++)
		{
			if (i == 1)
			{
				int suf = a[2] - a[1];
				mp[suf]--;
				if (mp[suf] == 0)mp.erase(suf);

				if (mp.size() == 0 || mp.size() == 1)
				{
					flag = 1;
					cout << pos[a[i]] << endl;
				}

				mp[suf]++;
			}
			else if (i == n)
			{
				int suf = a[n] - a[n-1];
				mp[suf]--;
				if (mp[suf] == 0)mp.erase(suf);

				if (mp.size() == 0 || mp.size() == 1)
				{
					flag = 1;
					cout << pos[a[i]] << endl;
				}

				mp[suf]++;
			}
			else
			{
				int pre = a[i] - a[i - 1];
				int suf = a[i + 1] - a[i];
				int New = a[i + 1] - a[i - 1];
				mp[pre]--;
				mp[suf]--;
				mp[New]++;

				if (mp[pre]== 0)mp.erase(pre);
				if (mp[suf] == 0)mp.erase(suf);

				if (mp.size() == 0 || mp.size() == 1)
				{
					flag = 1;
					cout << pos[a[i]] << endl;
				}

				mp[suf]++;
				mp[pre]++;
				mp[New]--;
				if (mp[New] == 0)mp.erase(New);
			}
			if (flag)break;
		}
		if (!flag)puts("-1");
	}
}
// 2 4 6 7 8