lastdancee's blog

By lastdancee, history, 6 hours ago, In English

I can solve some pretty tough problems involving DP, graphs, and data structures. Sometimes I can handle problems that feel much more “advanced” technically.

But strangely, when I face some Div.2 A/B/C problems, especially greedy, constructive, or adhoc, I often get completely stuck . This kind of observation feels very different from DP or graph problems. In DP, I usually ask: What is the state? What is the transition? How do I optimize it?

But in these small constructive/greedy problems, I dont know what to do or coul not think of any solutions that i have approached before . How can i fix this bugs ?

Full text and comments »

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

By lastdancee, history, 4 weeks ago, In English

ECNERWALA HAY PHU HO TOI DAM TOI DAU DUNG TOI DO , CAI SUB NAO CHAC TAY SUB DAY KHONG DOC NHAM DE , KHONG NGO THUAT , KHONG CODE BUG . YEU ANH ECNERWALA

Full text and comments »

  • Vote: I like it
  • -6
  • Vote: I do not like it