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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 161 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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
Название |
---|