Kmcode's blog

Code Monk (Segment Tree,RMQ,Lazy Propagation)
By Kmcode, history, 9 years ago, In English

Hello, competitive programmers!

Are you interested in segment tree? or Do you think lazy segment tree is difficult?

I invite you to take part in Code Monk(Segment Tree,RMQ,Lazy Propagation).

You can check the start time here.

This is one of CodeMonk series. This contest will be held for programmer who is a beginner for (lazy) segment-tree, so we also prepared the tutorial of segment tree (and lazy segment tree). You can read it here.

There are 4 problems in this contest, segment tree or lazy segment tree problems.

Do you think segment tree is very easy? Then,this contest will be easy for you ,so how about solving very fast, and become a winner?

If you are interested in this contest, why don't you participate in it?

Also there are some prizes for newbie programmer. You can learn more details about it here.

At last, I introduce Author&Problem Setters&Problem Tester&Editorialist:

Author: r3gz3n

Setters:aditya1495 camypaper subway aqfaridi

Tester:Kmcode

Editionalist:usaxena95

Don't forget to participate this contest. I am looking forward to seeing you on the Leaderboard.

Keep coding!

Good luck everyone!

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

»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Kmcode (previous revision, new revision, compare).

→ Reply
»
9 years ago, # |
  Vote: I like it +9 Vote: I do not like it

This may be a stupid question, but I can't find the answer.

In CodeMonk, who is considered a newbie ?

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    ”First time winner — if someone has already been given a prize, they are not awarded again. The intention is to encourage new people. Beginner programmer — you might be new to Code Monk but we also like to encourage people who are relatively new to programming itself. To determine this we look at the participants profile, their past activity and their coding profile on other sites. The winners are decided by Code Monk team based on the above two criteria." so, it depends on hackerearth.

    → Reply
    • »
      »
      »
      9 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Prizes are only for the indian coders or everyone is eligible?

      → Reply
      • »
        »
        »
        »
        9 years ago, # ^ |
          Vote: I like it +3 Vote: I do not like it

        Of course, everyone is eligible.

        → Reply
»
9 years ago, # |
  Vote: I like it +9 Vote: I do not like it

Problems were nice.

→ Reply
»
9 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Congratulations to W4yneb0t, uwi and radoslav11 for bagging the top three places! :)

→ Reply
»
9 years ago, # |
  Vote: I like it +6 Vote: I do not like it

Ive read recently What a nice way to learn Great tutos

→ Reply