Taming the Herd

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Early in the morning, Farmer John woke up to the sound of splintering wood. It was the cows, and they were breaking out of the barn again!

Farmer John was sick and tired of the cows’ morning breakouts, and he decided enough was enough: it was time to get tough. He nailed to the barn wall a counter tracking the number of days since the last breakout. So if a breakout occurred in the morning, the counter would be 0 that day; if the most recent breakout was 3 days ago, the counter would read 3. Farmer John meticulously logged the counter every day.

The end of the year has come, and Farmer John is ready to do some accounting. The cows will pay, he says! But lo and behold, some entries of his log are missing!

Farmer John is confident that the he started his log on the day of a breakout. Please help him determine, out of all sequences of events consistent with the log entries that remain, the minimum and maximum number of breakouts that may have take place over the course of the logged time.

Input
The first line contains a single integer N (1≤N≤100), denoting the number of days since Farmer John started logging the cow breakout counter.

The second line contains N space-separated integers. The ith integer is either −1, indicating that the log entry for day i is missing, or a non-negative integer ai (at most 100), indicating that on day i the counter was at ai.

Output
If there is no sequence of events consistent with Farmer John’s partial log and his knowledge that the cows definitely broke out of the barn on the morning of day 1, output a single integer −1. Otherwise, output two space-separated integers m followed by M, where m is the minimum number of breakouts of any consistent sequence of events, and M is the maximum.

Example
inputCopy
4
-1 -1 -1 1
outputCopy
2 3
Note
In this example, we can deduce that a breakout had to occur on day 3. Knowing that a breakout also occurred on day 1, the only remaining bit of uncertainty is whether a breakout occurred on day 2. Hence, there were between 2 and 3 breakouts in total.
思路：标记有钉子的点，有矛盾就输出-1.

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll M=110;
ll n,a[M],ans1=0,ans2=0;
bool bk[M];
int main(){
	cin>>n;
	for(ll i=0;i<n;i++) cin>>a[i];
	for(ll i=0;i<n;i++)
		if(a[i]>i)
			return printf("-1\n")*0;
	bk[0]=1;
	for(ll i=1;i<n;i++)
		if(a[i]>=0)
			bk[i-a[i]]=1;
	for(ll i=1;i<n;i++)
		if(a[i]>0){
			ll k=i-a[i];
			for(ll j=k+1;j<=i;j++)
				if(bk[j]!=0)
					return printf("-1\n")*0;
		}
	for(ll i=0;i<n;i++)
		if(bk[i]==1)
			ans1++;
	ll nn=n-1;
	while(a[nn]==-1){
		bk[nn]=1;
		nn--;
	}
	ll i=nn;
	while(i>0){
		while(i>0 && (a[i]==-1 || a[i]==0)){
			bk[i]=1;
			i--;
		}
		if(a[i]>0)
			i-=a[i];
	}
	for(ll i=0;i<n;i++)
		if(bk[i]==1)
			ans2++;
	printf("%lld %lld\n",ans1,ans2);
	return 0;
}