OJ Board

Alexander Denisjuk wrote:Consider please:
10239 The Book-shelver's Problem (the shortest path)
10266 Surveying (connected components)
709 Formatting Text (the shortest path)

Could you give me some hints about those problems?

I got AC on other problems in this thread, but I have exactly no idea about the three you listed.

My AC program gives the following output for your input:

[c]
3
1 4 5
5
1 5 6 7 9
7
1 5 6 8 9 10 12
6
1 5 6 10 12 14
0
1
2
1 3
2
1 3
3
1 3 5
2
1 3
2
1 3
3
2 4 7
99
1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 ...

I am stuck in this problem. Anyone can help??
I tried DP and divide and conquer but these two all got TLE.

Finallly, I got accepted. I changed flaot to double and changed the last line to
[c]
printf( "%6.2lf%17lld\n", x, ways[ n ] );
[/c]

I used the same code and solved 357 and 674, but I got WA in 147.
Did miss something?? :-? frustrated....
(I searched for post of 147 but I can't get the problem in my program)

[c]
#include <stdio.h>
#define MAX 6000

long long ways[ MAX + 1 ] = { 0 };
int coins[ 11 ] = { 2000, 1000, 400, 200, 100 ...