Search found 3 matches
- Sun Feb 01, 2004 1:47 pm
- Forum: Volume 6 (600-699)
- Topic: 615 - Is It A Tree?
- Replies: 71
- Views: 23639
- Sun Feb 01, 2004 11:57 am
- Forum: Volume 6 (600-699)
- Topic: 615 - Is It A Tree?
- Replies: 71
- Views: 23639
this judge is so distressing
because dealing with the input is much harder than solving the problem.
what's the tricky case for problem 615 is it a tree ?
what's the tricky case for problem 615 is it a tree ?
- Sat Jan 31, 2004 11:59 am
- Forum: Volume 5 (500-599)
- Topic: 539 - The Settlers of Catan
- Replies: 22
- Views: 8106
539 what's the idea?
what's the idea for this problem ? i tried to do a modified dfs starting from each node and memorize the longest distance but i get time limit exceeded.. here's my code: [pascal] program settlers; var mat,A:array [0..50,0..50] of integer; max:integer; n:integer; procedure DF(i,l:integer); var j:inte...