Peak Detection

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

Given a sequence a_0, a_1, ... , a_{n-1} of integer values as an input.
Detect all "peak" and mark using '*'.
If a_i is a "peak",
1. There exist 2 index l and r, s.t. l < i < r, a_i - a_l > 9, a_i - a_r > 9.
2. a_i is a max value of the subsequence a_{l+1}, ... ,a_{r-1}.

Options

exec is denied

now post-mortem time, all source codes will be revealed

Sample input:_

10
0
9
0
10
0
11
0
10
1
11
1
10
0
9
1
11
5
15
4
15
7
0
5
10
15
20
15
10
5
0
5
10
15
20
15

Sample output:

10
0
9
0
10*
0
11*
0
10
1
11*
1
10
0
9
1
11
5
15*
4
15*
7
0
5
10
15
20*
15
10
5
0
5
10
15
20
15

Sample input:_

14
14
1
16
17
10
9
19
11
18
2
14
18
4
10
12

Sample output:

14
14
1
16
17
10
9
19*
11
18
2
14
18*
4
10
12

Sample input:_

14
14
1
16
17
10
7
19
11
18
2
14
18
4
10
12

Sample output:

14
14
1
16
17*
10
7
19*
11
18
2
14
18*
4
10
12

Ranking

Ruby _

Perl _

Python _

Scheme _

Common LISP _

Io _

JavaScript _

Lua _

Smalltalk _

BASIC _

J _

C _

D _

OCaml _

Haskell _

Ada _

Pascal _

AWK _

sed _

Postscript _

GolfScript _

Vim _

goruby _

Groovy _

Language Ranking_

return to the top page