Search found 95 matches
- Sun Dec 31, 2006 6:27 am
- Forum: Algorithms
- Topic: Classic matrix problem
- Replies: 5
- Views: 3064
SRX you're talking about a different problem which asks to find the largest rectangle that doesn't contain any cell with it's value 0. For the maximal sum problem the best algorithm I know about is very complicated. It is better than the O(n^3) but is slower than O(n^3 / log n) so it doesn't really ...
- Sat Oct 21, 2006 5:58 am
- Forum: Algorithms
- Topic: Problems using LCA form arhive.
- Replies: 8
- Views: 4170
- Sat Sep 09, 2006 2:08 am
- Forum: Algorithms
- Topic: Maximum sum of n vectors -> in O(n lg n)
- Replies: 15
- Views: 4896
http://www.hsin.hr/2003/national/first_ ... oblems.pdf
last problem.
You can find the official solution on the same page.
last problem.
You can find the official solution on the same page.
- Thu Sep 07, 2006 6:37 pm
- Forum: Algorithms
- Topic: Maximum sum of n vectors -> in O(n lg n)
- Replies: 15
- Views: 4896
- Fri Aug 18, 2006 7:41 pm
- Forum: Algorithms
- Topic: algorithm to determine that polygon is star-shaped
- Replies: 7
- Views: 3033
- Fri Aug 18, 2006 2:57 pm
- Forum: Algorithms
- Topic: algorithm to determine that polygon is star-shaped
- Replies: 7
- Views: 3033
- Mon Aug 07, 2006 3:07 pm
- Forum: Algorithms
- Topic: Matrix Multiplication O(nlgn) problems
- Replies: 5
- Views: 2152
- Mon Jul 31, 2006 7:49 pm
- Forum: Algorithms
- Topic: O(log n) Fibonacci
- Replies: 4
- Views: 2961
- Mon Jul 31, 2006 2:31 am
- Forum: Algorithms
- Topic: Line up problem ..
- Replies: 5
- Views: 2205
- Wed Jul 26, 2006 4:16 pm
- Forum: Algorithms
- Topic: longest path
- Replies: 7
- Views: 2811
- Thu Jun 01, 2006 1:27 am
- Forum: Algorithms
- Topic: Shortest path
- Replies: 10
- Views: 3995
I wonder if this sol runs in time on sgu: http://acm.sgu.ru/problem.php?contest=0&problem=145
- Thu Jun 01, 2006 12:34 am
- Forum: Algorithms
- Topic: Shortest path
- Replies: 10
- Views: 3995
- Wed May 31, 2006 12:26 pm
- Forum: Algorithms
- Topic: Shortest path
- Replies: 10
- Views: 3995
It's pretty complex, you could search for k shortest path on google or look over this paper: http://www.ics.uci.edu/~eppstein/pubs/p-kpath.html
- Tue May 30, 2006 12:31 pm
- Forum: Algorithms
- Topic: Help on testing point inside a polygon
- Replies: 5
- Views: 2007
http://www.exaflop.org/docs/cgafaq/cga2.html
(no special cases)
(no special cases)
- Mon May 29, 2006 3:11 pm
- Forum: Algorithms
- Topic: constructing permutations with limitations
- Replies: 3
- Views: 1435