Acrobatics Show (APCS 2024-06 Beginner)

Points 100 1.0s 256M

A town has \(n\) tall buildings with heights \(h_1, h_2, \ldots, h_n\). The mayor wants to hold an aerial acrobatics show that glides from the top of some building rightward to the ground. For the performers' safety, the heights along the gliding path must be strictly decreasing. Find the length of the longest such gliding path.

In other words, find a contiguous segment of buildings \(h_i, h_{i+1}, \ldots, h_j\) with \(h_i > h_{i+1} > \cdots > h_j\) that has the most buildings, and output that count.

Input

The first line contains a positive integer \(n\).

The second line contains \(n\) positive integers \(h_1, h_2, \ldots, h_n\), the building heights.

Constraints

  • \(5 \le n \le 100\)
  • \(1 \le h_i \le 1000\)

Output

Output the length of the longest gliding path (the maximum number of consecutive strictly decreasing buildings).

Scoring

The time limit for each test case is \(1\) second; your score is the sum over the test cases you pass. The subtasks are:

  • Subtask 1 (\(60\) points): \(n = 5\).
  • Subtask 2 (\(40\) points): no constraints.

Sample Input 1

5
6 2 5 3 1

Sample Output 1

3

Sample Input 2

10
31 41 97 93 23 89 59 26 15 58

Sample Output 2

4

Source

APCS programming exam, June 2024, Problem 1.

Problem page help

Keyboard shortcuts

Main features

  • Sample tests — Runs the sample cases bundled with the problem and auto-compares against the expected output.
  • Custom test — Run your code with your own stdin. Optionally tick the "Compare with expected (diff)" box to verify against expected output line-by-line.
  • Template — Paste the default code template you set on your profile page.
  • Collab — Edit this problem together with classmates in real time.
  • Auto-draft — Editor contents auto-save to your browser every 1.5 seconds (per account / problem / language).
  • Submit — Send your code to the judge for grading; returns AC / WA / TLE etc.

Limits

  • Source code: at most 65,536 characters
  • Custom test stdin and expected output: at most 1 MB each (≈1 million characters)
  • Custom test and sample test share the sandbox; about 1 request per 3 s per user (sample test: 1 per 1 s)
  • Custom test and sample test both have a 15 second wall-clock cap (the official judge still uses the problem time limit)
  • Interactive problems do not offer custom test (cannot simulate interaction with the judge).
  • Submitting has no rate limit, but rapid repeated submissions on the same problem are treated as score farming.