Threads: http://vn.spoj.com/problems/LATGACH/ First we consider a rectangular 2×1 there 1 placing it ranked 1 brick 2×1. At the rectangular 2×2 there 2 placing it ranked 2 1 member×2 or 2 2 members×1. At the rectangular 2xi have the following cases with f(in) the placing of the rectangle 2xi. => f(in) = f(i-1) + f(i-2) with f(1) = 1 and […]

Threads and test: link For an integer array of N elements A[1], The[2], … The[N]. Knowing that is monotonically increasing subsequence 1 Series A[i1],… The[I] correspond i1 < i2 < … < I và A[i1] < The[i2] < .. < The[I]. Please indicate monotonically increasing subsequence of the sequence length how many elements? Download and test solution (C / C , Pascal) here. Input Field […]

Dynamic programming method is used to solve optimization problems with recursive nature, ie finding the optimal method for problems that can lead to find the optimal scheme of a finite number of subproblem. For many recursive algorithms, the principle of divide and rule (spill and Conquer) often play a key role in the design of algorithms. To […]

Threads: http://vn.spoj.pl/problems/M3TILE/