【Codeforces370E】Summer Reading [构造]

Summer Reading

Time Limit: 20 Sec  Memory Limit: 512 MB

Description

　　

Input

　　

Output

　　

Sample Input

　　7
　　0 1 0 0 0 3 0

Sample Output

　　3
　　1 1 2 2 3 3 3

HINT

　　

Solution

　　

Code

 #include<iostream>
 #include<string>
 #include<algorithm>
 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<cmath>
 #include<vector>
 using namespace std;
 typedef long long s64;
 
 const int ONE = ;
 const int MOD = 1e9 + ;
 
 int n;
 int a[ONE];
 int vis[ONE], ans[ONE];
 
 struct power
 {
         int val, times;
         friend bool operator <(power a, power b)
         {
             if(a.val != b.val) return a.val < b.val;
             return a.times < b.times;
         }
 }low[ONE], up[ONE];
 
 int get()
 {
         int res;char c;
         while( (c=getchar())< || c> );
         res=c-;
         while( (c=getchar())>= && c<= )
         res=res*+c-;
         return res;
 }
 
 void Deal_first()
 {
         low[] = up[] = (power){, };
         for(int i = ; i <= n; i++)
         {
             low[i] = low[i - ], up[i] = up[i - ];
 
             if(++low[i].times > ) low[i] = (power){low[i].val + , };
             if(++up[i].times > ) up[i] = (power){up[i].val + , };
 
             if(a[i] != )
             {
                 if(low[i].val > a[i] || up[i].val < a[i])
                 {
                     printf("-1");
                     exit();
                 }
                 low[i] = max(low[i], (power){a[i], });
                 up[i] = min(up[i], (power){a[i], });
             }
 
             if(low[i].val > up[i].val) {printf("-1"); exit();}
         }
 }
 
 int main()
 {
         n = get();
         for(int i = ; i <= n; i++)
             a[i] = get();
         if(a[] > ) {printf("-1"); exit();}
         Deal_first();
 
         int val = up[n].val - (up[n].times == );
         if(low[n].val > val) {printf("-1"); exit();}
         for(int i = n; i >= ; i--)
         {
             val = min(val, up[i].val);
             val -= vis[val] == ;
             ans[i] = val, vis[val]++;
         }
 
         if(ans[] <= ) {printf("-1"); exit();}
 
         printf("%d\n", ans[n]);
         for(int i = ; i <= n; i++)
             printf("%d ", ans[i]);
 
 }