zoukankan      html  css  js  c++  java
  • E. Exposition

                                                                        E. Exposition
    time limit per test
    2 seconds
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    There are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writer. It was decided as well that it is necessary to include into the exposition only those books that were published during a particular time period. It is obvious that if the books differ much in size, the visitors will not like it. That was why the organizers came to the opinion, that the difference between the highest and the lowest books in the exposition should be not more than k millimeters.

    The library has n volumes of books by Berlbury, arranged in chronological order of their appearance. The height of each book in millimeters is know, it is hi. As Berlbury is highly respected in the city, the organizers want to include into the exposition as many books as possible, and to find out what periods of his creative work they will manage to cover. You are asked to help the organizers cope with this hard task.

    Input

    The first line of the input data contains two integer numbers separated by a space n (1 ≤ n ≤ 105) and k (0 ≤ k ≤ 106) — the amount of books by Berlbury in the library, and the maximum allowed height difference between the lowest and the highest books. The second line contains n integer numbers separated by a space. Each number hi (1 ≤ hi ≤ 106) is the height of the i-th book in millimeters.

    Output

    In the first line of the output data print two numbers a and b (separate them by a space), where a is the maximum amount of books the organizers can include into the exposition, and b — the amount of the time periods, during which Berlbury published a books, and the height difference between the lowest and the highest among these books is not more than k milllimeters.

    In each of the following b lines print two integer numbers separated by a space — indexes of the first and the last volumes from each of the required time periods of Berlbury's creative work.

    Sample test(s)
    input
    3 3
    14 12 10
    output
    2 2
    1 2
    2 3
    input
    2 0
    10 10
    output
    2 1
    1 2
    input
    4 5
    8 19 10 13
    output
    2 1
    3 4
     1 #include <iostream>
     2 #include <stdio.h>
     3 #include <set>
     4 using namespace std;
     5 int a[10000000],c[100000];
     6 int main()
     7 {
     8     int n,k,i,b=0,max=0,p=0;
     9     scanf("%d%d",&n,&k);
    10     multiset<int> z;
    11     for(i=0; i<n; i++)
    12     {
    13         scanf("%d",&a[i]);
    14         z.insert(a[i]);
    15         while(*z.rbegin()-*z.begin()>k)z.erase(z.find(a[b++]));
    16         if(i-b+1>max)
    17         {
    18             max=i-b+1,p=0;c[p++]=b;
    19         }
    20         else if(i-b+1==max)
    21         {
    22             c[p++]=b;
    23         }
    24     }
    25     cout<<max<<" "<<p<<endl;
    26     for(i=0; i<p; i++)
    27         printf("%d %d
    ",c[i]+1,c[i]+max);
    28 }
    View Code
  • 相关阅读:
    【题解】洛谷 P3942 将军令【20201017 CSP 模拟赛】【贪心】
    ASP.NET上传文件的三种基本方法
    Android 最火的快速开发框架XUtils
    asp.net 上传文件到一般处理程序中
    Android版本:使用findViewById()用字符串/在一个循环
    android 调用系统图库查看指定路径的图片
    Android中实现日期时间选择器(DatePicker和TimePicker)
    Android自定义ListView的Item无法响应OnItemClick的解决办法
    Android开发配置,消除SDK更新时的“https://dl-ssl.google.com refused”异常
    mysql 修改密码
  • 原文地址:https://www.cnblogs.com/ERKE/p/3575677.html
Copyright © 2011-2022 走看看