Problem Link : 1955D - Неточный поиск подперестановки Submission : 256939551 My Approach : I tried to solve this problem using and array of size (1e6+1).Wth the help of sliding window technique i updated the segments. But i got Time limit Exceeded for O(N). Unable to figure out why Im getting TLE. Could someone please help me out in this.
Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 166 |
| 2 | Um_nik | 162 |
| 2 | maomao90 | 162 |
| 2 | atcoder_official | 162 |
| 5 | -is-this-fft- | 157 |
| 5 | adamant | 157 |
| 7 | awoo | 155 |
| 7 | djm03178 | 155 |
| 9 | TheScrasse | 154 |
| 10 | Dominater069 | 153 |
→ Find user
→ Recent actions
Comments (0)
Write comment?
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/07/2024 02:20:27 (l2).
Desktop version, switch to mobile version.
Supported by
