codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

602B.md (2060B)


      1 Source: https://codeforces.com/problemset/problem/602/B
      2 
      3 B. Approximating a Constant Range
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium intensity would be choosing a sufficiently large number of consecutive data points that seems as constant as possible and taking their average. Of course, with the usual sizes of data, it's nothing challenging — but why not make a similar programming contest problem while we're at it?
     22 
     23 You're given a sequence of *n* data points *a*1, ..., *a**n*. There aren't any big jumps between consecutive data points — for each 1 ≤ *i* < *n*, it's guaranteed that |*a**i* + 1 - *a**i*| ≤ 1.
     24 
     25 A range [*l*, *r*] of data points is said to be almost constant if the difference between the largest and the smallest value in that range is at most 1. Formally, let *M* be the maximum and *m* the minimum value of *a**i* for *l* ≤ *i* ≤ *r*; the range [*l*, *r*] is almost constant if *M* - *m* ≤ 1.
     26 
     27 Find the length of the longest almost constant range.
     28 
     29 Input
     30 
     31 The first line of the input contains a single integer *n* (2 ≤ *n* ≤ 100 000) — the number of data points.
     32 
     33 The second line contains *n* integers *a*1, *a*2, ..., *a**n* (1 ≤ *a**i* ≤ 100 000).
     34 
     35 Output
     36 
     37 Print a single number — the maximum length of an almost constant range of the given sequence.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 5  
     45 1 2 3 3 2
     46 ```
     47 
     48 Output
     49 
     50 ```
     51 4
     52 ```
     53 
     54 Input
     55 
     56 ```
     57 11  
     58 5 4 5 5 6 7 8 8 8 7 6
     59 ```
     60 
     61 Output
     62 
     63 ```
     64 5
     65 ```
     66 
     67 Note
     68 
     69 In the first sample, the longest almost constant range is [2, 5]; its length (the number of data points in it) is 4.
     70 
     71 In the second sample, there are three almost constant ranges of length 4: [1, 4], [6, 9] and [7, 10]; the only almost constant range of the maximum length 5 is [6, 10].