simplify initiation

lrvideckis · adamant-pwn · commit dbbdbc2bc763 · 2022-10-28T01:15:32.000+02:00
diff --git a/src/data_structures/sparse-table.md b/src/data_structures/sparse-table.md
@@ -42,8 +42,7 @@ int st[K + 1][MAXN];
 Because the range $[i, i + 2^j - 1]$ of length $2^j$ splits nicely into the ranges $[i, i + 2^{j - 1} - 1]$ and $[i + 2^{j - 1}, i + 2^j - 1]$, both of length $2^{j - 1}$, we can generate the table efficiently using dynamic programming:
 
 ```{.cpp file=sparsetable_generation}
-for (int i = 0; i < N; i++)
-    st[0][i] = f(array[i]);
+st[0] = array;
 
 for (int j = 1; j <= K; j++)
     for (int i = 0; i + (1 << j) <= N; i++)
@@ -64,8 +63,7 @@ We can construct the data structure with:
 ```{.cpp file=sparsetable_sum_generation}
 long long st[K + 1][MAXN];
 
-for (int i = 0; i < N; i++)
-    st[0][i] = array[i];
+st[0] = array;
 
 for (int j = 1; j <= K; j++)
     for (int i = 0; i + (1 << j) <= N; i++)
@@ -127,8 +125,7 @@ Afterwards we need to precompute the Sparse Table structure. This time we define
 ```{.cpp file=sparse_table_minimum_generation}
 int st[K + 1][MAXN];
 
-for (int i = 0; i < N; i++)
-    st[0][i] = array[i];
+st[0] = array;
 
 for (int j = 1; j <= K; j++)
     for (int i = 0; i + (1 << j) <= N; i++)
