WOSS Dual Olympiad 2022 J2: Counting Christmas Trees

View as PDF

Submit solution

All submissions

Best submissions

Points: 3

Time limit: 2.0s

Memory limit: 256M

Authors:

SuperMK, Wozunubi

Problem type

You have gone to visit a plantation of Christmas trees before the holidays! The plantation you have visited is quite unique, as it consists of one row of $N$ $N$ Christmas trees, numbered from $1$ $1$ to $N$ $N$ . Each of them has a height value, with the $i$ $i$ th tree being assigned a height of $h_i$ $h_{i}$ .

You are interested in finding patterns within the trees. Therefore, your job is to create a program that will output the length of the longest contiguous group of trees strictly increasing in height and the length of the longest contiguous group of trees strictly decreasing in height. The same tree(s) can be included in the two different contiguous groups.

Constraints

$2 \le N \le 2\,000$ $2 \leq N \leq 2 000$

$1 \le h_i \le 200$ $1 \leq h_{i} \leq 200$

Input Specification

The first line consists of a single integer, $N$ $N$ , representing the number of Christmas trees.

The second line contains $N$ $N$ space-separated integers, with the $i$ $i$ th integer on the second line representing the value $h_i$ $h_{i}$ , or the height of the $i$ $i$ th tree.

Output Specification

The output should consist of two lines: the first line should contain a single integer, giving the length of the longest contiguous group of trees that are strictly increasing in height, and the second line should also contain a single integer, giving the length of the longest contiguous group of trees that are strictly decreasing in height.

Sample Input 1

Copy

4
1 3 4 2

Sample Output 1

Copy

3
2

Explanation of Sample 1

The longest contiguous group of strictly increasing tree heights is $[1, 3, 4]$ $[1, 3, 4]$ , which has a length of $3$ $3$ . The longest contiguous group of strictly decreasing tree heights is $[4, 2]$ $[4, 2]$ , which has a length of $2$ $2$ .

Sample Input 2

Copy

10
2 1 4 6 8 2 9 5 2 3

Sample Output 2

Copy

4
3

Explanation of Sample 2

The longest contiguous group of strictly increasing tree heights is $[1, 4, 6, 8]$ $[1, 4, 6, 8]$ , which has a length of $4$ $4$ . The longest contiguous group of strictly decreasing tree heights is $[9, 5, 2]$ $[9, 5, 2]$ , which has a length of $3$ $3$ .

Comments

0

jasonstorybank commented on Dec. 2, 2023, 3:13 p.m.

hii whoever reading

0

b_nary commented on Dec. 2, 2023, 8:01 p.m.

impasta

0

jasonstorybank commented on Dec. 2, 2023, 3:13 p.m.

hi

0

jasonstorybank commented on Nov. 24, 2023, 11:26 p.m.

i dont get this:(

0

thomas_li commented on Nov. 24, 2023, 11:40 p.m.

imposter