Advertisement
Guest User

Untitled

a guest
Nov 17th, 2017
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.58 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. typedef long long ll;
  4. ll a[1000005];
  5. int main ()
  6. {
  7. ll i,j,n,ans,p;
  8. while (scanf("%lld",&n)==1)
  9. {
  10. ans=1;
  11. for (i=1;i<=n;i++)
  12. {
  13. scanf("%lld",&a[i]);
  14. }
  15. ll mini=n-a[n];
  16. for (i=n;i>=2;i--)
  17. {
  18. mini=min(mini,i-a[i]);
  19. if (a[i]==0)
  20. {
  21. if (mini>=i)
  22. ans++;
  23.  
  24. }
  25.  
  26. //cout<<mini<<' '<<ans<<endl;
  27.  
  28. }
  29.  
  30. cout<<min(n,ans)<<endl;
  31. }
  32. return 0;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement