Hello. I solve DP problems. But I can't solve this problem. Please help me.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3845 |
2 | jiangly | 3707 |
3 | Benq | 3630 |
4 | orzdevinwang | 3573 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3532 |
8 | ecnerwala | 3501 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 163 |
3 | awoo | 161 |
4 | nor | 152 |
5 | maroonrk | 151 |
5 | -is-this-fft- | 151 |
7 | TheScrasse | 148 |
8 | atcoder_official | 146 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Hello. I solve DP problems. But I can't solve this problem. Please help me.
Название |
---|
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!