informatics_3328

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

const int INF = 1e9;

void build(vector<long long>& z, vector<int>& a, int& n, int l, int r, int now) {
	if (l > r) {
		return;
	}
	else if (l == r) {
		z[now] = a[l];
		return;
	}
	int mid = (l + r) / 2;
	build(z, a, n, l, mid, now * 2);
	build(z, a, n, mid + 1, r, now * 2 + 1);
	z[now] = max(z[now * 2], z[now * 2 + 1]);
}

long long query(vector<long long>& z, int l, int r, int a, int b, int now) {
	if (l > r || a > r || b < l) {
		return -INF;
	}
	if (a <= l && b >= r) {
		return z[now];
	}
	int mid = (l + r) / 2;
	return max(query(z, l, mid, a, b, now * 2), query(z, mid + 1, r, a, b, now * 2 + 1));
}

void add(int n, vector<long long>& z, int l, int r, int a, int b, int now, long long delta, vector<long long>& ad) {
	if (a > r || b < l) {
		return;
	}
	if (a <= l && b >= r) {
		ad[now] += delta;
		return;
	}
	if (l == r) {
		return;
	}
	int mid = (l + r) / 2;
	add(n, z, l, mid, a, b, now * 2, delta, ad);
	add(n, z, mid + 1, r, a, b, now * 2 + 1, delta, ad);
	z[now] = max(z[now * 2] + ad[now * 2], z[now * 2 + 1] + ad[now * 2 + 1]);
}

int main()
{
	int n;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	vector<long long> z(n * 2, 0);
	vector<long long> ad(n * 2, 0);
	build(z, a, n, 0, n - 1, 1);
	int m;
	cin >> m;
	for (int i = 0; i < m; ++i) {
		char c;
		int l, r;
		cin >> c >> l >> r;
		if (c == 'm') {
			cout << query(z, 0, n - 1, l - 1, r - 1, 1) << " ";
		}
		else {
			long long delta;
			cin >> delta;
			add(n, z, 0, n - 1, l - 1, r - 1, 1, delta, ad);
		}
	}
}