can anyone please share his idea of solving problem 23E .

we are given a tree and we have to remove some edges from the tree (>=0) to maximize the product of sizes of connected components !

can anyone please explain how this problem will reduce to 0/1 Knapsack problem after increasing each t[i] by 1?

why we are increasing t[i] by 1 ?

Anyone who has solved problem E , please explain his approach .

the editorial says that first calculate cost for first level rows then do recalculation, but how to do it ? its quite unclear.

Problem

Upd:

What I thought is.. Suppose we have processed upto row no. x optimally and now processing x+1.

The calculation for the current row will not change the optimality of the row till x.

If we use this observation for the 1st row , We can optimally calculate the optimal cost to repaint the first row and make it in the form ABABAB....

Now... I got stuck from the 2nd row onwards..

What should we do to calculate the optimal cost for repainting from 2nd row to last row.

How should we process the column elements for a particular row ?

Upd 2:

Sol.`

Anyone who solve problem 16E, can please share his ideas.There is no official solution of this round. link

in the announcement thread it is mentioned that it will be solved using state compression dp , but what is state compression dp and what will be the dp state for this question ?

anyone who solved this problem http://mirror.codeforces.com/problemset/problem/12/D , can please share his ideas.

i have read this blog http://mirror.codeforces.com/blog/entry/44775#comment-437643 , the explanation which is written by

@satyaki3794 , how will it fit in time limit ?

Can anyone who solved problem 7E share his ideas , how to solve it.

http://mirror.codeforces.com/contest/7/problem/E