关于NOIP-T4暴力分

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const ll N=1e6+6;
ll n,m,c,a[N],w[N],dp[N];
ll sum[N],maxx[N];
void solve(){
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> a[i];
		sum[i]=sum[i-1]+a[i];
	}
	ll q;
	cin >> q;
	while(q--){
		ll L,R;
		cin >> L >> R;
		for(int i=1;i<=n;i++) maxx[i]=LONG_LONG_MIN;
		for(int len=L;len<=R;len++){
			for(int l=1;l<=n-len+1;l++){
				ll r=l+len-1;
				for(int j=l;j<=r;j++){
					maxx[j]=max(maxx[j],(sum[r]-sum[l-1]));
				}
			}
		}
		ull ans=0;
		for(int i=1;i<=n;i++){
			ans^=(i*(unsigned long long)maxx[i]);
		} 
		cout << ans << "\n";
	}
	return ;
} 
int main(){
//	freopen("query.in","r",stdin);
//	freopen("query.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll T=1;
	while(T--) solve();
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const ll N=1e6+6;
ll n,m,c,a[N],w[N],dp[N];
ll sum[N],maxx[N];
void solve(){
	cin >> n;
	for(int i=1;i<=n;i++){
		cin >> a[i];
		sum[i]=sum[i-1]+a[i];
	}
	ll q;
	cin >> q;
	while(q--){
		ll L,R;
		cin >> L >> R;
		for(int i=1;i<=n;i++) maxx[i]=LONG_LONG_MIN;
		for(int l=1;l<=n;l++){
			for(int r=l+L-1;r<=min(n,l+R-1);r++)
				for(int j=l;j<=r;j++){
					maxx[j]=max(maxx[j],(sum[r]-sum[l-1]));
				}
		}
		ull ans=0;
		for(int i=1;i<=n;i++){
			ans^=(i*(unsigned long long)maxx[i]);
		} 
		cout << ans << "\n";
	}
	return ;
} 
int main(){
//	freopen("query.in","r",stdin);
//	freopen("query.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	ll T=1;
	while(T--) solve();
	return 0;
}