Algorithm

B. Walking in the Rain
time limit per test
2 seconds
memory limit per test
256 megabytes
Problem link- https://codeforces.com/problemset/problem/192/B
input
standard input
output
standard output

In Berland the opposition is going to arrange mass walking on the boulevard. The boulevard consists of n tiles that are lain in a row and are numbered from 1 to n from right to left. The opposition should start walking on the tile number 1 and the finish on the tile number n. During the walk it is allowed to move from right to left between adjacent tiles in a row, and jump over a tile. More formally, if you are standing on the tile number i (i < n - 1), you can reach the tiles number i + 1 or the tile number i + 2 from it (if you stand on the tile number n - 1, you can only reach tile number n). We can assume that all the opposition movements occur instantaneously.

In order to thwart an opposition rally, the Berland bloody regime organized the rain. The tiles on the boulevard are of poor quality and they are rapidly destroyed in the rain. We know that the i-th tile is destroyed after ai days of rain (on day ai tile isn't destroyed yet, and on day ai + 1 it is already destroyed). Of course, no one is allowed to walk on the destroyed tiles! So the walk of the opposition is considered thwarted, if either the tile number 1 is broken, or the tile number n is broken, or it is impossible to reach the tile number n from the tile number 1 if we can walk on undestroyed tiles.

The opposition wants to gather more supporters for their walk. Therefore, the more time they have to pack, the better. Help the opposition to calculate how much time they still have and tell us for how many days the walk from the tile number 1 to the tile number n will be possible.

Input

The first line contains integer n (1 ≤ n ≤ 103) — the boulevard's length in tiles.

The second line contains n space-separated integers ai — the number of days after which the i-th tile gets destroyed (1 ≤ ai ≤ 103).

Output

Print a single number — the sought number of days.

Examples
input
Copy
4
10 3 5 10
output
Copy
5
input
Copy
5
10 2 8 3 5
output
Copy
5
Note

In the first sample the second tile gets destroyed after day three, and the only path left is 1 → 3 → 4. After day five there is a two-tile gap between the first and the last tile, you can't jump over it.

In the second sample path 1 → 3 → 5 is available up to day five, inclusive. On day six the last tile is destroyed and the walk is thwarted.



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <stdio.h>

using namespace std;

int const N = 1e3 + 1;
int n, a[N];

int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; ++i)
		scanf("%d", a + i);

	int res = 0;
	while(true) {
		if(a[0] == 0 || a[n - 1] == 0) {
			printf("%d\n", res);
			return 0;
		}

		for(int j = 0; j < n;) {
			if(j == n - 1)
				break;

			if(j + 2 < n && a[j + 2] > 0)
				j += 2;
			else if(j + 1 < n && a[j + 1]> 0)
				++j;
			else {
				printf("%d\n", res);
				return 0;
			}
		}

		for(int j = 0; j < n; ++j)
			--a[j];

		++res;
	}

	printf("%d\n", res);

    return 0;
}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
4
10 3 5 10

Output

x
–
+
cmd
5
Advertisements

Demonstration

Codeforcess Solution Walking in the Rain, B. Walking in the Rain ,C,C++, Java, Js and Python ,Walking in the Rain,Codeforcess Solution

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+