0分(5WA,5TLE)求助
查看原帖
0分(5WA,5TLE)求助
1044048
Algorithm_ZRF楼主2023/8/5 08:00
#include <bits/stdc++.h>
using namespace std;
const int maxn = 11e4 + 514;
int n, a[maxn], m, cnt;
inline void read() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
	}
	cin >> m;
	int ans[n + 5];
	for (int i = 1; i <= m; ++i) {
		int l, r;
		cin >> l >> r;
		for (int i = 1; i <= r; ++i) {
			ans[i] = a[i];
		}
		cnt = ans[r] - ans[l - 1];
		cout << cnt;
	}
	
}


signed main() {
	read();
	return 0;
}
2023/8/5 08:00
加载中...