Hi everyone. When I try to solve a C or D problem. it turn out to be difficult for me I dont know what to do. I spend almost all my time in those problems but without success.
# | 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 |
Hi everyone. When I try to solve a C or D problem. it turn out to be difficult for me I dont know what to do. I spend almost all my time in those problems but without success.
Name |
---|
C and D is almost the same as A and B. A little bit harder of course, but they are still algorithmic problems.
What kind of advice do you want to hear? 'Do that and this and you will solve almost every C and D problem'? I think that nobody can give you such an advice.
Keep training.
how does C & D differ from E? just asking...
learn basic algorithms and sort problems by number of solvers....
I think this is better because there are some B problems harder than some C problems most of A problems can be solved without studying algorithms but most of B,C and D problems need algorithmic knowledge and data structures.
learn these topics:
dynamic programming
graph algorithms
data structures :set,vector,queue,....
most of C and D problems can be solved simply if you know these topics especially data structures.....
and finally practice,practice and practice....
sorry for my bad English.
if it's so easy then why can't you do it?
It's more useful to solve problems, than creating this kind of blogs