Well,I have difficulty in solving constructive-algorithm problems.So how can I solve them correctly and faster?

If I get an answer,I will be very thanksful to you.

# | User | Rating |
---|---|---|

1 | tourist | 3707 |

2 | Benq | 3672 |

3 | Radewoosh | 3627 |

4 | ksun48 | 3547 |

5 | Miracle03 | 3480 |

6 | ecnerwala | 3400 |

7 | peehs_moorhsum | 3384 |

8 | maroonrk | 3361 |

9 | sunset | 3338 |

10 | Um_nik | 3320 |

# | User | Contrib. |
---|---|---|

1 | 1-gon | 209 |

2 | Um_nik | 197 |

3 | YouKn0wWho | 192 |

4 | Errichto | 182 |

5 | sus | 181 |

6 | awoo | 180 |

7 | tourist | 175 |

8 | -is-this-fft- | 171 |

8 | SecondThread | 171 |

10 | Ashishgup | 170 |

Well,I have difficulty in solving constructive-algorithm problems.So how can I solve them correctly and faster?

If I get an answer,I will be very thanksful to you.

↑

↓

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/25/2021 05:09:49 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

i don't want to offend you but this is so cyan

This is so red)

1000 cyans triggered"so cyan" means what?

exactly what someone my rating would post

means Cyanic

This is so Um_nik

Um_nik would mean to offend.

I asked a similar question in codeforces. Someone told me that I should solve more constructive-algorithm problems.

solving problem for little

n's usually help also making subtasks for yourself to solve(special cases,etc) may help.I have difficulty in solving greedy-algorithm problems.So how can I solve them correctly and faster?

If I get an answer,I will be very thanksful to you.

That's too simple, just think what a greedy person would do to solve the problem.

This person must be smart, I can't just think like smart :(

One of my favorite ways to approach any problem I have no clue about is to write a naïve (maybe even exponential) solution. I run this solution on a bunch of small inputs and this way I can see if there are any patterns that might lead to a full solution. I feel like this applies especially well to constructive and greedy problems, but it is also pretty useful for DP as well.

This is the only type that cannot be improved. Just wait for remaking.

How to improve other types?

Solve more! Solve more! Solve more!

Remaking ?

This won't help you get better at constructive problems, but sometimes it is possible to avoid the setters' intentions and solve these problems with DP. I remember 4 such problems that really bait the contestant into thinking all kinds of constructive greedies but could be solved with DP or DP-like solutions:

by coding.

by emptyhoping /se

I'm surprised even masters ask this question

Experts want to know the answer to the question too :(

IGMs want to know the answer to the question too :(

Newbies want to know the answer to the question too :(

How do you do well being slow(according to you) in solving constructive-algorithm problems ? :s

Do well for other problem types and pray that you don't get a Constructiveforces. (I actually prefer constructive problems to others though)