Hello. I solve DP problems. But I can't solve this problem. Please help me.
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
Hello. I solve DP problems. But I can't solve this problem. Please help me.
Name |
---|
I think this approach should work.
Let dp[i] denote the maximum number of events he can attend ending no later than the i-th minute, so that the (i+1)-th minute is obviously available. The base case is dp[0] = 0. Then we can loop from minute 1 to minute 30,000. You can do this by, for example, storing the starting minutes of each event ending at the i-th minute in vector a[i]. This way, you'll know what events you should consider. We have this:
Initially, dp[i] = dp[i-1], then dp[i] = max(dp[i], dp[a[i][j]-1]+1) for all i and j (1 <= i <= 30,000; j < a[i].size())
The overall complexity is O(N + 30,000).
Please let me know if there are any mistakes. Hope this helps :D
Thank you very much. It works!