#include<iostream>
#include<algorithm>
using namespace std;
//1-indexed
#include<vector>
template<typename T>
struct BIT{
	int n;
	vector<T>bit;
	BIT(int n_=0):n(n_),bit(n_+1){}
	T sum(int i)
	{
		T ans=0;
		for(;i>0;i-=i&-i)ans+=bit[i];
		return ans;
	}
	void add(int i,T a)
	{
		if(i==0)return;
		for(;i<=n;i+=i&-i)bit[i]+=a;
	}
	int lower_bound(T k)//k<=sum(ret)
	{
		if(k<=0)return 0;
		int ret=0,i=1;
		while((i<<1)<=n)i<<=1;
		for(;i;i>>=1)
			if(ret+i<=n&&bit[ret+i]<k)k-=bit[ret+=i];
		return ret+1;
	}
};
int N;
int A[2<<17];
main()
{
	cin>>N;
	BIT<int>P(N);
	for(int i=1;i<=N;i++)
	{
		int a;cin>>a;P.add(i,a);
		A[i]=a;
	}
	int Q;cin>>Q;
	int ans=0;
	for(int i=24;i<=N;i++)
	{
		ans=max(ans,P.sum(i)-P.sum(i-24));
	}
	for(;Q--;)
	{
		int t,v;cin>>t>>v;
		P.add(t,v-A[t]);
		A[t]=v;
		for(int i=max(0,t-24);i<=min(N-24,t);i++)
		{
			ans=max(ans,P.sum(i+24)-P.sum(i));
		}
		cout<<ans<<endl;
	}
}