OJ Board

i use floyd to calculate distance between each store
and build a new graph that contains only store node and home node
then I use a bit DP to find the max profit

is this algorithm wrong?

can someone give me some test data ?

btw, what is the range of the cost of road and money saved in stoer ...

but still get wrong answer...

i see, thanks for you hint

I solve it like this:
if(a>b)swap(a,b);
if(a*(k+2)==b) it_is_losing
else it_is_winning



Am I missing something?? or I used a wrong algorithm??

please help me.

i just got ac.

i noticed that each diamond must connect to another diamond or the wall.

so i enumerate the father of a diamond node. and then calculate the total langth.


i got acc but i don't know how to prove my method right.


i wonder how you guys solved this problem,and whether my algo was ...

this is ridiculous.

wow~ it's cool..

can this problem solved with A* searching?

if it can,how?

wow~ got it. really a cool way.

but how do you prove it correct?

I mean how do you prove that correct when you insert 8 between 0 and 4 that 4 6 8 will not form a progression?



let n=13,
first consider 2 0.
now, you've 2 insert 4 and (4,2,0) forms an arithmetic progression. so, insert 4 in the ...

still dont quite understand..

but will try to figure it out

anyone help..

to sunny:

when inserting 8,would you consider 4 and 6?


obviously,8 is between 4and6, and , 4and0
then,there will be no place for 8

i think i dont quite understand your method

i think the O(n^2) algorithm will not get a tle

first,calculate the permutation for N=10000

then,for the case n<=10000,the solution is the subset of the former permution,from which you just need to printf the element that is smaller than or equal to n.

then we just need to compute 10000^2 times ...

can anyone give me some tips to solve this problem?

灌个水!