I use simple dynamic programing and get TLE.
Have you calculated your time for this problem,
becose almost everyone has got TLE.???

Do you use loops like

for(i=CurrentStation-1; i>=InitialStation; i--) {
  if(Cost[i]+ticketcost(i,CurrentStation)<Cost[Current...] ?

If yes, you should get TLE if you traverse all stations but
not those nearer that L3. I got accepted in 1.94 sec on my
first try.

> Do you use loops like
>
> for(i=CurrentStation-1; i>=InitialStation; i--) {
>   if(Cost[i]+ticketcost(i,CurrentStation)<Cost
[Current...] ?
>
>>>I think no.

> If yes, you should get TLE if you traverse all stations
but
> not those nearer that L3. I got accepted in 1.94 sec on my
> first try.

I use this
i:=Curent_Statin;
while  (i>Initial_Station) and (Distance(Curent,i)<L3) do
....

Ha.
I got ACC with 2:89 sek.
I think the time limmit was 2:00 sek?????

> Ha.
> I got ACC with 2:89 sek.
> I think the time limmit was 2:00 sek?????
>
New time limit is 3 seconds.