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
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 144 |
| 4 | Um_nik | 144 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 9 | maroonrk | 132 |
| 10 | Proof_by_QED | 131 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/29/2026 02:51:55 (g2).
Desktop version, switch to mobile version.
Supported by
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)