Features of special data limits

Правка en3, от OtterZ, 2024-09-24 09:47:58

If you know some special features of special data limit,you can find some way that others don't know but is able to pass the test and can't be hacked.

1.Addition limits feature

For $$$a_i \in N,\sum a_i \le W$$$,it's sure that there are at most $$$\sqrt W$$$ distinct number in array $$$a_i$$$.

For some strings problem,there are limits of the total length of strings $$$M$$$,as those strings have at most $$$\sqrt M$$$ distinct length.

example:

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский OtterZ 2025-10-18 14:03:04 829 (published)
en3 Английский OtterZ 2024-09-24 09:47:58 6 Tiny change: 'For $a_i \exists N,\sum a_' -> 'For $a_i \in N,\sum a_'
en2 Английский OtterZ 2024-09-24 09:47:45 1 Tiny change: 'a_i \exist N,\sum a_' -> 'a_i \exists N,\sum a_'
en1 Английский OtterZ 2024-09-24 09:47:32 473 Initial revision (saved to drafts)