any one help??  I need help...

I use  radom to generate 200 chain list,and then cut the chain list, using O(polynomial) dynamic programming, it is WA on test # 26,

then I use regular brute_force search  times>=1e7 return,  it WA on test #28...

anyone give some ideas??

I think cut the chain method get WA is because though between two rows there is at most one same buyer, but there maybe more then two rows have same buyers

for exmaple ,structure of solution maybe   0--1---2--3--4--5---0
                                           0--1--6--0
                                           0--2--7--0
                                           0--3--8--0
                                           0--4--9--0
                                           0--5--10--0



Edited by author 14.12.2016 14:14

AC now it is some stupid bugs on my code??

btw ,  I think this problem is much easier than ural 1394 why not find accuarcy solution?