Search found 3 matches
- Thu Jun 30, 2011 3:36 am
- Forum: Volume 8 (800-899)
- Topic: 849 - Radar Tracking
- Replies: 10
- Views: 11909
Re: 849 - Radar tracking
After much hair-pulling, finally got AC. I have my doubts that the judge is correct though. For example, consider the input '285.10 697.47 88.60 288.07'. The AC solution is '96.85 971.19 98.96 2496.18', but I think the second of these is not valid. For the third intercept to be at 98.96, the first ...
- Wed Jun 22, 2011 8:14 pm
- Forum: Volume 8 (800-899)
- Topic: 849 - Radar Tracking
- Replies: 10
- Views: 11909
Re: 849 - Radar tracking
Does anyone have a hint on how to solve this one? I tried mapping the plane's angle as a function of time, which gives a non-linear function that intersects the radar's angle 0-3 times/sweep. I'm attaching a graph of the first solution of the third sample so you can see what I'm talking about; you ...
- Fri Jun 03, 2011 11:22 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10159 - Star
- Replies: 9
- Views: 3780
Re: 10159 - Star
Bruno,
It is possible to find min value without searching. First, assume entire board is 0 except maximums given. The only way to reduce the min value is for the maximum values for two or three lines to be from the same triangle. For example, in the given data D, G, and I lines all have a max value ...
It is possible to find min value without searching. First, assume entire board is 0 except maximums given. The only way to reduce the min value is for the maximum values for two or three lines to be from the same triangle. For example, in the given data D, G, and I lines all have a max value ...