OJ Board

I don't think he completely bypassed the size of the alphabet, but I think he ignored it because it could be treated as a constant. You can pass the time limit with hashing too, if you have a good implementation. Check out little joey's comments at: http://online-judge.uva.es/board/viewtopic.php?t=...

I have two method to solve your problem, and both of them are related to the size of the strings (but I think the O(t*n) is better than O(n^2) where t refers to the length of the string) ... The second method uses hash instead of Sorting and Searching with binary search. (Ofcourse I ignore problems...

Hi. I'm coding in rhide v1.4.9. I'm having trouble with debugging C++ code. Say I start tracing into (F7 option). All I can see during this process is last few lines of code instead of highlighted line that is being executed. Another one problem is that sometimes I can't see values of variables in W...

Hello I'm having WA for this problem, and after having rewrote it from scratch twice, and read the whole forum. So I'm now going to an extremity I never used before : posting my algorithm and my whole source here, hoping that someone we'll help me ;) The algo is simple : DP with a table l [j] where...

There is a way to find LIS in O(n log n).
If you have found LIS for first i-1 elements, calculating LIS for i-th element should be done in O(log n). Think of such structure.

I've found a negative-weight cycle (cycle itself) with Floyd-Warshall in O(n^4). Please, does anyone know how to do it faster? I need to do it in dynamic graph and remove them after detected, so it would take really long to complete it. I

Excuse me. Can anyone post the pseudocode for Bellman-Ford's Algorithm here? d[i] <- infinity for each i except for source (i.e. starting node), so d[source] <- 0 for i <- 1 to |V[G]| - 1 do for each edge (u, v) in E[G] if d[v] > d[u] + w(u, v) d[v] <- d[u] + w(u, v) If you want to know if there is...

Given directed weighted graph determine a negative cycle C, (c1,c2,

Are there any instances of minimum cost flow problem at UVA?

Maxim

Well, you could include "string.h" (cstring), and do something like this:
[cpp]#include <cstring>
...
int a[10], b[10];
...
memcpy(b, a, sizeof a); //copy a to b[/cpp]
But you should be careful about third parameter.

Maxim

First of all, set not only line1[num] and line2[num] to zero, but all num + 1 elements of each line to zero.
After computation, only line1[num] might be leading zero, so test only for it, not whole line1.

Maxim

Can anyone tell me or prove whether this problem can be solved using Network flow?

Thanks,
Maxim

It's quite tricky to solve this problem using Floyd-Warshall. Your program doesn't work well because of additional cost when passing through some station. I've been testing your program and I couldn

What about case when r and s are the same stations (find cheapest path from node to itself)? Your program outputs 0, instead of 1.1 * b[j] / val ?
Am I right? I think this is the only mistake you've made.

Maxim

Follow this link: http://acm.uva.es/problemset/minput.html

Maxim