EnderShadow8

قبل 4 سنواتdiscuss

Segment trees are the foundation upon which all of competitive programming is built.

قبل 4 سنواتdiscuss

You can write an extension which evals a JS file to recreate this

قبل 4 سنواتdiscuss

Why not use double quotes for strings in all languages? It makes sense for a number of reasons. Single quotes are much more likely to be in the contents of a string than double quotes.

Of course, if you have a style guide, you should stick to that.

EnderShadow8

قبل 4 سنواتdiscuss

It makes it more cumbersome to copy the URL

EnderShadow8

قبل 4 سنواتdiscuss

Actually that's also wrong, I usually see this rule applied in other languages:

If the opening bracket is on the same line as content, then so is the closing bracket.

By this rule, we have two options:

  (+
     (EXPT 23 2.4)
     (SIN (\* 44 0.23 22))
     (COS (+ 12 0.43 19.0))
     (TAN (/ 1.4 0.77 3/4))
  )

  (+ (EXPT 23 2.4)
     (SIN (\* 44 0.23 22))
     (COS (+ 12 0.43 19.0))
     (TAN (/ 1.4 0.77 3/4)))

The first option has both opening and closing brackets on their own lines, while the second has neither. Note that I consider the function name to be part of the opening bracket since it's distinct from the parameters.

This is consistent with other languages:

  [1, 2, 3]
  f(x, y, z)
  [
    1,
    2,
    3,
  ]
  f(
    x,
    y,
    z
  )

instead of

  [1,
   2,
   3,
  ]
  f(x,
    y,
    z,
   )

EnderShadow8

قبل 4 سنواتdiscuss

Segment trees are objectively superior in all ways except implementation length

EnderShadow8

قبل 4 سنواتdiscuss

I've been told to consider it constant for all practical purposes

EnderShadow8

قبل 4 سنواتdiscuss

Treap: https://en.wikipedia.org/wiki/Treap

It's like a Red-Black tree in use case, but much faster to implement, which is good for competitive programming. The average case complexity is the same for all operations, but there's an unlikely degeneration to worst-case linked-list behaviour.

Lazy Propagation Segment Tree: https://cp-algorithms.com/data_structures/segment_tree.html

Like a segment tree in that it supports range queries in logarithmic time, but supports range updates in log time as well.

I know a few more fun ones that I occasionally use in contests, but I've never touched otherwise.

comments