P403106 - GYM101005 I Substring - SSOJ - 省实信息奥赛评测系统

Memory Limit：64 MB Time Limit：0 S

Judge Style：Text Compare Creator：

Submit：0 Solved：0

上一题 Submit 下一题 Submit Record Statistics MD

I. Substringtime limit per test0.65 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard output

Given an array of positive integers, count the number of substrings with the following properties:

it has length of at least 2
its extremities are bigger than the other elements (e.g. 2 2 3 is bad, but 3 2 3 is good)

Input

The input will contain on the first line one integer $\text{[math]}$ ( $\text{[math]}$ . The second line contains $\text{[math]}$ numbers $\text{[math]}$ and the array for which we want the solution is obtained as following: $\text{[math]}$ . Both arrays $\text{[math]}$ and $\text{[math]}$ are 0-indexed.

Output

The output will contain the number of substrings with the given properties.

ExampleInput

3
3 2 3

Output

All You Can Code 2008 (Romanian Contest)

403106: GYM101005 I Substring

Description

Source/Category

加入题单