Hi, can someone help me solve this problem:
Input consist of integer n and array a of n integers. Output number of pairs (a[i],a[j]), i<j who are adjacent or for all k (i<k<j) this equation is true: a[k]<=min(a[i],a[j]).
1<=n<=10^6
0<=a[i]<=2^31
# | User | Rating |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | maroonrk | 152 |
4 | nor | 152 |
6 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Problem from one Serbian contest
Hi, can someone help me solve this problem:
Input consist of integer n and array a of n integers. Output number of pairs (a[i],a[j]), i<j who are adjacent or for all k (i<k<j) this equation is true: a[k]<=min(a[i],a[j]).
1<=n<=10^6
0<=a[i]<=2^31
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
Brankonymous | 2018-10-29 23:10:57 | 50 | Tiny change: 'a[i]<=2^31' -> 'a[i]<=2^31\n\nexample:\n\n8\n\n4 1 2 3 6 5 1 2\n\nOutput: 11' | |
en1 |
![]() |
Brankonymous | 2018-10-29 23:09:10 | 287 | Initial revision (published) |
Name |
---|