Plz help me in solving this problem?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | 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 | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Plz help me in solving this problem?
Name |
---|
link to problem?
It's a greedy and brute force problem.
For any given message order, process the packets greedily. You should repeat the following process for each packet.
The minimum needed buffer size for the message order will be the maximum among all the buffer sizes at Step 3.
Since N ≤ 5, you can try out all possible orderings of the messages. Every packet will be added only once to the buffer and removed only once, so the process is linear for each ordering, hence the total complexity will be O(M * N!).
If possible can you plz explain me with code, it will be very helpful to me.
Here is the code if you want to check some implementation details, but I suggest you code it and submit it yourself until you get AC.
C++ Code