Hello. I solve DP problems. But I can't solve this problem. Please help me.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
4 | atcoder_official | 158 |
4 | cry | 158 |
4 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
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!