Polynomial Algorithms
This post introduces some tricks on polynomials widely used in ICPC. I will try to practice algebraic knowledge as well.
Algorithm
View All TagsThis post introduces some tricks on polynomials widely used in ICPC. I will try to practice algebraic knowledge as well.
Rephrase the chess picking problem in a more formal way.
Discuss POJ3557 Map Generator and its variants.
This post discusses Longest Increasing Subsequence (LIS) and network flow problem.
When solving a problem, it is common that we have two different strategies that fit in different cases. For example, one algorithm may have a better time complexity but uses more memory than the other. Or, one is fast when there are only a few of large objects, but the other works better when there are many small objects. However, I found that there usually exists a solution which is a naive mixture of the two strategies, and its performance will be the sqrt of the two.