我是超级大神蒟蒻,求救(满江红)
《超级宇宙无敌的暴力算法》
#include <bits/stdc++.h>
using namespace std;
unsigned long long total, temp, n, f, l, r, k;
int main() {
cin >> n >> f;
unsigned long long a[n + 10];
for (unsigned long long i = 1; i <= n; i++) {
cin >> temp;
a[i] = temp;
}
temp = 0;
while (f--) {
cin >> total;
switch (total) {
case 1:
cin >> l >> r >> k;
for (unsigned long long i = l; i <= r; i++)
a[i] += k;
break;
case 2:
cin >> k;
a[1] += k;
break;
case 3:
cin >> k;
a[1] -= k;
break;
case 4:
cin >> l >> r;
for (unsigned long long i = l; i <= r; i++)
temp += a[i];
cout << temp << '\n';
temp = 0;
break;
case 5:
cout << a[1] << '\n';
break;
}
}
return 0;
}