CCF CSP 编程题目和解答-----试题名称：相邻数对-------201409-1

#include<iostream>
#include<stdlib.h>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<strstream>
using namespace std;
int main()
{
int n;
cin >> n ;
map<int, int> all;
for (int i = 0; i < n; i++)
{
int tem;
cin >> tem;
all.insert(pair<int,int>(tem,0));
}
int count = 0;
map<int, int>::iterator it = all.begin();
for (it; it != all.end(); it++)
{
int tem = it->first;
int less = tem - 1;
int more = tem + 1;
if (all.find(less) != all.end())
count++;
if (all.find(more) != all.end())
count++;
}
count /= 2;//所有的对子都重复算了两遍
cout << count;
}