Xavier Holt edited CST_Monopolar_Consider_every_point__1.md  almost 8 years ago

Commit id: 4bd104f17ad7198501e403784c90d932541ab7f5

deletions | additions      

       

* Remove the first element from P and denote it `x`  * \(L_r\leftarrow |i, x|\), \(R_r\leftarrow 0\).  * \(L_p \leftarrow x\)  * d \(\leftarrow L_r + R_r\)  * For \(p \in P\): O(n)  * \(R_r \leftarrow \max \{R_r, |j, L_p|\}\)  * \(L_r \leftarrow |i,p|\); \(L_p \leftarrow p\)  * d \(\leftarrow \min \{d, R_r + L_r\}\)  * Return d + |i,j|