can someone please give a solution to this problem[problem:978A][user:DessertRommet]
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 155 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | djm03178 | 152 |
can someone please give a solution to this problem[problem:978A][user:DessertRommet]
Name |
---|
Play with the indexes this time, store the last index of each element either in a map data structure, or an array will work too as array elements are from 1 to 1000.
then create a list/array/vector of the answer and store all the last index in it. Then sort the list, as the index are in increasing order.
print the size and print the element with respective index.
Like this (pseudo code) ->
check the submission if needed -> 172281151
I like how your pseudocode is very descriptive. +1