Codeforces and Polygon may be unavailable from December 6, 19:00 (UTC) to December 6, 21:00 (UTC) due to technical maintenance. ×

saiteja_0712's blog

By saiteja_0712, 8 months ago, In English

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.

  • Vote: I like it
  • +4
  • Vote: I do not like it