zoukankan      html  css  js  c++  java
  • 2019 3 26 自闭晚的第二天

    D-div2是真水题,自己真菜哟。根据样例写了一下对应关系,就找到了一个规律,即不断更新最大值,若其与下标相等,ans++,就这样ac了;当然我必须要换个法子写,根据样例的规律写毕竟不怎么靠谱。

    D-div2

    Ivan recently bought a detective book. The book is so interesting that each page of this book introduces some sort of a mystery, which will be explained later. The ii-th page contains some mystery that will be explained on page aiai (aiiai≥i).

    Ivan wants to read the whole book. Each day, he reads the first page he didn't read earlier, and continues to read the following pages one by one, until all the mysteries he read about are explained and clear to him (Ivan stops if there does not exist any page ii such that Ivan already has read it, but hasn't read page aiai). After that, he closes the book and continues to read it on the following day from the next page.

    How many days will it take to read the whole book?

    Input

    The first line contains single integer nn (1n1041≤n≤104) — the number of pages in the book.

    The second line contains nn integers a1,a2,,ana1,a2,…,an (iaini≤ai≤n), where aiai is the number of page which contains the explanation of the mystery on page ii.

    Output

    Print one integer — the number of days it will take to read the whole book.

    Example

    Input
    9
    1 3 3 6 7 6 8 8 9
    
    Output
    4
    

    Note

    Explanation of the example test:

    During the first day Ivan will read only the first page. During the second day Ivan will read pages number 22 and 33. During the third day — pages 44-88. During the fourth (and the last) day Ivan will read remaining page number 99.

    #include<iostream>
    #include<cstring>
    using namespace std;
    int a[10005],b[10005];
    int main()
    {
     int n;
     cin>>n;
     //memset(c,0,sizeof(c));
     for(int i=1;i<=n;i++)
      {
       cin>>a[i];
       //b[i]=i;
      }
     int  max=0,ans=0;
     for(int i=1;i<=n;i++)
      {
       if(max<a[i])
        max=a[i];
       if(max==i)
        ans++;
      }
     cout<<ans<<endl;
     return 0;
    }
  • 相关阅读:
    如何解决列表框控件宽度不够的问题
    在windows Forms程序里面实现文件上传
    TFS的一些信息
    百钱百鸡问题
    如何移动SQL SERVER的系统数据库
    数据分页技术
    如何在报表中直接使用数据库中存储的图片
    重新注册MSJetOledb 4.0引擎
    2007 Microsoft Office Servers 已知问题/自述文件
    使用For XML与XSL(XSLT)配套快速输出查询结果到Web页面
  • 原文地址:https://www.cnblogs.com/liyexin/p/10597921.html
Copyright © 2011-2022 走看看