Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

Not_Hadid_007's blog

By Not_Hadid_007, history, 9 minutes ago, In English

What clues do you usually look for when identifying a Greedy problem during a contest? Are there any common patterns, constraints, or characteristics that help you recognize one? I'd love to hear your approaches and experiences!

  • Vote: I like it
  • +1
  • Vote: I do not like it

»
5 minutes ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Look for problems where the best local choice leads to the global optimum. Always verify that the greedy choice is valid.

  • »
    »
    3 minutes ago, hide # ^ |
     
    Vote: I like it +1 Vote: I do not like it

    But what techniques do you personally use to verify that a local optimal choice will actually lead to a global optimum? Do you rely on mathematical proofs, testing, or both?"