| 26 | } |
| 27 | |
| 28 | void change(int p, const int &k) { |
| 29 | p += tn; this->t[p] = k; p >>= 1; |
| 30 | while (p) { |
| 31 | if (this->t[p<<1] < this->t[p<<1|1]) { |
| 32 | this->t[p] = this->t[p<<1]; |
| 33 | this->num[p] = this->num[p<<1]; |
| 34 | } |
| 35 | else { |
| 36 | this->t[p] = this->t[p<<1|1]; |
| 37 | this->num[p] = this->num[p<<1|1]; |
| 38 | } |
| 39 | p >>= 1; |
| 40 | } |
| 41 | } |
| 42 | }; |
no outgoing calls
no test coverage detected