I was trying to solve this problem. Here my solution which got TLE. So i copied the exact author's solution in Java but it's still getting TLE. solution
Can anyone tell me whats happening here?
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
I was trying to solve this problem. Here my solution which got TLE. So i copied the exact author's solution in Java but it's still getting TLE. solution
Can anyone tell me whats happening here?
There are n cities in a circle and distance between every adjacent pair of cities was given. We were asked to determine a pair of cities such that the minimum distance to travel between them is maximum.
For example,the input may be: 8 12 16 10 3 13.
We can definitely solve this in O(n2) complexity.Can we improve the complexity any further?how?
I can't find any website that helps in visualization of competitive programming questions such as DP,trees and thinking of making one myself. Any Suggestions to what tools u need. Here's a link to similar webpage.
So I'm using java and i got this error.anyone know what this means. For code refer to this
Name |
---|