package main import ( "fmt" "bufio" "os" "strconv" ) type KeyValue struct { key int value int } type SegmentTree struct { n int dat []*KeyValue } func (this *SegmentTree) new(n int) { this.n = 1 for this.n < n { this.n *= 2 } this.dat = make([]*KeyValue, 2*this.n-1) for i := 0; i < 2*this.n-1; i++ { this.dat[i] = &KeyValue{-1, -1} } } func (this *SegmentTree) update(k int, a int) { i := k k += this.n - 1 this.dat[k].key = i this.dat[k].value = a for k > 0 { k = (k - 1) / 2 this.dat[k] = Max(this.dat[k * 2 + 1], this.dat[k * 2 + 2]) } } func (this SegmentTree) max() int { return this.dat[0].key + 1 } func (this SegmentTree) get(i int) int { return this.dat[i + this.n - 1].value } func Max(a *KeyValue, b *KeyValue) *KeyValue{ if a.value > b.value { return a } else if a.value < b.value { return b } else if a.key >= b.key { return a } else { return b } } func main() { sc := bufio.NewScanner(os.Stdin) sc.Split(bufio.ScanWords) sc.Scan() sc.Scan() M, _ := strconv.Atoi(sc.Text()) var tree SegmentTree tree.new(M) for i := 0; i < M; i++ { sc.Scan() a, _ := strconv.Atoi(sc.Text()) tree.update(i, a) } sc.Scan() Q, _ := strconv.Atoi(sc.Text()) for i := 0; i < Q; i++ { sc.Scan() t, _ := strconv.Atoi(sc.Text()) sc.Scan() x, _ := strconv.Atoi(sc.Text()) sc.Scan() y, _ := strconv.Atoi(sc.Text()) if t == 1 { tree.update(x-1, tree.get(x-1) + y) } else if t == 2 { tree.update(x-1, tree.get(x-1) - y) } else { fmt.Printf("%d\n", tree.max()) } } }