Hoofball

time limit per test5 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
In preparation for the upcoming hoofball tournament, Farmer John is drilling his N cows (conveniently numbered 1…N, where 1≤N≤100) in passing the ball. The cows are all standing along a very long line on one side of the barn, with cow i standing xi units away from the barn (1≤xi≤1000). Each cow is standing at a distinct location.

At the beginning of the drill, Farmer John will pass several balls to different cows. When cow i receives a ball, either from Farmer John or from another cow, she will pass the ball to the cow nearest her (and if multiple cows are the same distance from her, she will pass the ball to the cow farthest to the left among these). So that all cows get at least a little bit of practice passing, Farmer John wants to make sure that every cow will hold a ball at least once. Help him figure out the minimum number of balls he needs to distribute initially to ensure this can happen, assuming he hands the balls to an appropriate initial set of cows.

Input
The first line of input contains N. The second line contains N space-separated integers, where the ith integer is xi.

Output
Please output the minimum number of balls Farmer John must initially pass to the cows, so that every cow can hold a ball at least once.

Example
inputCopy
5
7 1 3 11 4
outputCopy
2
Note
In the above example, Farmer John should pass a ball to the cow at x=1 and pass a ball to the cow at x=11. The cow at x=1 will pass her ball to the cow at x=3, after which this ball will oscillate between the cow at x=3 and the cow at x=4. The cow at x=11 will pass her ball to the cow at x=7, who will pass the ball to the cow at x=4, after which this ball will also cycle between the cow at x=3 and the cow at x=4. In this way, all cows will be passed a ball at least once (possibly by Farmer John, possibly by another cow).

It can be seen that there is no single cow to whom Farmer John could initially pass a ball

so that every cow would eventually be passed a ball.
思路：入度为0的点的个数+两个点成环且没有其他点指向他们（入度出度都为2）的点

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll M=1100;
ll n,x[M],to[M],in[M];
int main(){
	cin>>n;
	for(ll i=0;i<n;i++) cin>>x[i];
	if(n==1 || n==2)
		return 0*printf("1\n");
	sort(x,x+n);
	to[0]=1,to[n-1]=n-2,in[1]=in[n-2]=1;
	for(ll i=1;i<n-1;i++){
		if((x[i]-x[i-1])<=(x[i+1]-x[i])){
			to[i]=i-1;
			in[i-1]++;
		}
		else{
			to[i]=i+1;
			in[i+1]++;
		}
	}
	ll ans=0;
	for(ll i=0;i<n;i++)
		ans+=(!in[i]);
	for(ll i=0;i<n-1;i++)
		if(in[i]==1 && in[i+1]==1 && to[i]==i+1 && to[i+1]==i)
			ans++;
	cout<<ans;
	return 0;
}