#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("maxq.in");
ofstream fout("maxq.out");

struct nod {
    int suma;
    int  smax;
    int  smax_st;
    int  smax_dr;
};

int  n,m,a,b,operatie;
int  v[200001];
nod aint[4 * 200001];
int  maxim, ssm_st;

void build(int  node, int  st, int  dr) {
    if (st == dr) {
        aint[node].suma = v[st];
        aint[node].smax = v[st];
        aint[node].smax_st = v[st];
        aint[node].smax_dr = v[st];

        return;
    }

    int  mijloc = (st + dr) / 2;
    build(node * 2, st, mijloc);
    build(node * 2 + 1, mijloc + 1, dr);

    aint[node].suma = aint[node * 2].suma + aint[node * 2 + 1].suma ;
    aint[node].smax_st = max(aint[node * 2].smax_st, aint[node * 2 + 1].smax_st + aint[node * 2].suma);
    aint[node].smax_dr = max(aint[node * 2 + 1].smax_dr, aint[node * 2].smax_dr + aint[node * 2 + 1].suma);
    aint[node].smax = max(aint[node*2].smax, max(aint[node*2+1].smax, aint[node * 2].smax_dr + aint[node * 2 + 1].smax_st));
}

void update(int node, int st, int dr) {
    if (st == dr) {
        aint[node].suma = b;
        aint[node].smax = b;
        aint[node].smax_st = b;
        aint[node].smax_dr = b;
        return ;
    }

    int mijloc = (st + dr) / 2;
    if (a <= mijloc)
        update(node * 2, st, mijloc);
    else
        update(node * 2 + 1, mijloc + 1, dr);

    aint[node].suma = aint[node * 2].suma + aint[node * 2 + 1].suma ;
    aint[node].smax_st = max(aint[node * 2].smax_st, aint[node * 2 + 1].smax_st + aint[node * 2].suma);
    aint[node].smax_dr = max(aint[node * 2 + 1].smax_dr, aint[node * 2].smax_dr + aint[node * 2 + 1].suma);
    aint[node].smax = max(aint[node*2].smax, max(aint[node*2+1].smax, aint[node * 2].smax_dr + aint[node * 2 + 1].smax_st));

}

void query(int  node, int  st, int  dr) {
    if (b >= dr && st >= a) {
        maxim = max(maxim, max(aint[node].smax, aint[node].smax_st + ssm_st));
        ssm_st = max(ssm_st + aint[node].suma, aint[node].smax_dr);
        if (ssm_st < 0)
            ssm_st = 0;
        return;
    }

    int  mijloc = (st + dr) / 2;

    if (a <= mijloc) {
        query(node * 2, st, mijloc);
    }
    if (b > mijloc) {
        query(node * 2 + 1, mijloc + 1, dr);
    }

}

int main () {
    fin  >> n;
    for (int  i = 1; i<=n; i++) {
        fin  >> v[i];
    }

    fin  >> m;

    build(1,1,n);

    for (int  i = 1; i<=m; i ++) {
        fin  >>operatie >> a >> b;
        if (operatie == 1) {
            a++,b++;
            query(1,1,n);
            fout << maxim << '\n';
            maxim = -100001;
            ssm_st = 0;
        }
        else {
            a++;
            update(1,1,n);

        }
    }

}