Hello codeforces community . I am trying to solve this problem : but dont understand which topics' problem is this . Can anyone tell me ?
Is this a DP problem ?
Problem link : http://agc005.contest.atcoder.jp/tasks/agc005_b
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Hello codeforces community . I am trying to solve this problem : but dont understand which topics' problem is this . Can anyone tell me ?
Is this a DP problem ?
Problem link : http://agc005.contest.atcoder.jp/tasks/agc005_b
Name |
---|
range minimum query
For each index i find the biggest number r[i] such that min(a[i],..,a[r[i]])=a[i] and the smallest number l[i] such that min(a[l[i]],....,a[i])=a[i].
ans=sigma (r[i]-i+1)*(i-l[i]+1)
r[i] and l[i] can be computed with stacks in O(n).