Search found 9 matches

by Planeyang
Sat Mar 24, 2007 3:49 pm
Forum: Algorithms
Topic: 2D Segment Tree
Replies: 1
Views: 2863

2D Segment Tree

Segment Tree is really an useful Data Structure. But I didn't see many paper about it. I can't find it in any Algorithm and Data Structure book I have.

And Recently. I meet a problem, and I think I should use 2D segment tree. I wonder if there is an elegant way to coding it.

I really need help.
by Planeyang
Thu Nov 30, 2006 4:09 pm
Forum: Algorithms
Topic: Question on Equations?
Replies: 1
Views: 1381

Question on Equations?

Hi everybody. I am doing research on Equations, so I wanna do some practice. Is there any problems related to Equations Systems so I can use Gauss's Method to solve it. something related to Chinese Remainder Theory is also needed. Thank you very much. I really need them cause the deadline is not far...
by Planeyang
Sat Nov 04, 2006 6:08 pm
Forum: Volume 7 (700-799)
Topic: 787 - Maximum Sub-sequence Product
Replies: 39
Views: 19342

Thansk!!

Thank you very much Jan.

I find my mistake.

You're really a great helper
by Planeyang
Fri Oct 20, 2006 12:03 pm
Forum: Volume 7 (700-799)
Topic: 787 - Maximum Sub-sequence Product
Replies: 39
Views: 19342

787

I spend the whole afternoon in solving the problem but I always got WA. I tested the Input which i got from some topic in the forum and printed the Right output. I don't know Why I always got WA. is there any special points? Finally I got Ac. I made a mistake in comparing two big number. Really want...
by Planeyang
Wed Oct 18, 2006 6:38 pm
Forum: Algorithms
Topic: Single Source Shortest Path With Spare Graph
Replies: 2
Views: 1663

Single Source Shortest Path With Spare Graph

Is there any problems in UVA the SSSP with Spare Graph?
Can anyone give me some problems?

Maybe My description is not clear.

Well, I mean that I want some problems can sovled by Dijkstra+Heap.
by Planeyang
Wed Oct 18, 2006 6:31 pm
Forum: Algorithms
Topic: how to choose the num ???
Replies: 13
Views: 4298

sorry about my careless.
Thank you misof and Timo

The Program of Timo is really cool!
That's a very good idea.
by Planeyang
Wed Oct 18, 2006 4:39 am
Forum: Algorithms
Topic: how to choose the num ???
Replies: 13
Views: 4298

Well, It doesn't make sence to me.

Yeah,If there are over L/2 number the same. the midpoint is the number X.But how what can I do if less than L/2? Divide&conquer? I don't know how to do.


And, I really wanna know how to do it with space O(1) and time O(N)?
by Planeyang
Sun Oct 15, 2006 3:11 pm
Forum: Algorithms
Topic: How To Compute Shortest Distance Between Two Lines
Replies: 5
Views: 2574

but if unfortunately. We meet two parallel lines.
No one projection lies inside the other segment.

What can we do
by Planeyang
Sun Oct 15, 2006 1:37 pm
Forum: Algorithms
Topic: One question about Tree
Replies: 3
Views: 2018

A solution

I don't know if my solution is right. At first, We know that a Tree means N nodes connected with N-1 edges Second, For one edge in a Graph, it connect two Nodes. So D1+D2+...+Dn=2n-2 equal to the statments: There are n-1 edges in the Graph. // Each eage counted twice So, Of cosurse it's a tree At la...

Go to advanced search