codeforces A. Taming the Herd(水)

A. Taming the Herd

time limit per test:1 second
memory limit per test:256 megabytes
input:standard input
output:standard 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 00 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 NN (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 iith 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 mm followed by M, where mm is the minimum number of breakouts of any consistent sequence of events, and M is the maximum.

Example

input

4
-1 -1 -1 1

output

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.

分析

第一个是0，然后从后往前扫0，多出来的-1另开记录，只要不符合记录对应情况就输出-1；最大就是最小的数量加-1的数量；

代码

#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
#include<algorithm>
#define MS(X) memset(X,0,sizeof(X))
#define MSC(X) memset(X,-1,sizeof(X))
typedef long long LL;
using namespace std;
int n,st[105];
int main(){
    int pm=0,mi=0;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        scanf("%d",&st[i]);
    }
    for(int i=n-2;i>=0;i--){
        if(st[i+1]>0){
            if(st[i]==st[i+1]-1||st[i]==-1)
            st[i]=st[i+1]-1;
            else{
                puts("-1");
                return 0;
            }
        }
    }
    if(st[0]==-1) st[0]=0;
    for(int i=0;i<n;i++){
        if(st[i]==-1) pm++;
        if(st[i]==0) mi++;
    }
    if(st[0]!=0) puts("-1");
    else
        printf("%d %d\n",mi,mi+pm);
    return 0;
}