Submission #19680172

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
N,*A = $<.read.split.map(&:to_i)
A << 0
LD = [nil]*N
(0...N).each{|i|
  a = A[i]
  l = i-1
  l = LD[l] until A[l] < a
  LD[i] = l
}
RD = [nil]*N
(0...N).reverse_each{|i|
  a = A[i]
  r = i+1
  r = RD[r] until A[r] < a
  RD[i] = r
}
p (0...N).map{|i|
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

N,*A = $<.read.split.map(&:to_i)

A << 0

LD = [nil]*N
(0...N).each{|i|
	a = A[i]
	l = i-1
	l = LD[l] until A[l] < a
	LD[i] = l
}

RD = [nil]*N
(0...N).reverse_each{|i|
	a = A[i]
	r = i+1
	r = RD[r] until A[r] < a
	RD[i] = r
}

p (0...N).map{|i|
	A[i]*(RD[i]-LD[i]-1)
}.max

Submission Info

Judge Result