I'm getting TLE for my solution of this 616D - Longest k-Good Segment problem and here's my solution link: https://ideone.com/fork/mFxA7g How can I fix this? Also, here's my submission link: 219228830
I'm getting TLE for my solution of this 616D - Longest k-Good Segment problem and here's my solution link: https://ideone.com/fork/mFxA7g How can I fix this? Also, here's my submission link: 219228830
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Kevin114514 | 3655 |
| 3 | Benq | 3650 |
| 4 | maroonrk | 3427 |
| 5 | strapple | 3413 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | tourist | 3301 |
| 9 | turmax | 3297 |
| 10 | squareOf105 | 3262 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | maspy | 150 |
| 3 | nik_exists | 149 |
| 4 | Um_nik | 145 |
| 5 | Errichto | 139 |
| 6 | adamant | 136 |
| 7 | maroonrk | 134 |
| 8 | AmShZ | 133 |
| 8 | BledDest | 133 |
| 10 | DNR | 130 |
This code is O(N^2) i think
.
Okay. Thanks! But can you please tell me how can I solve this problem without set?
You are using set only to count the current number of unique numbers in the segment right?
Replace set with a variable
countCurrent.Replace
s.insert(a[i]);withif(!m[a[i]]) countCurrent++;Similarly, replace
if(!m[a[j]])s.erase(a[j]);withif(!m[a[j]]) countCurrent--;I hope it helps.
Thanks a lot! It helped me solve this problem.
Doesn't size() work in O(1)?
Yes. It does.
So i don't think that the problem's in that, I agree with the guy above, your solution might be just O(n^2)