#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define int long long
const int K = 50;
int L[K], R[K];
const int N = 5e5 + 7;
int _time[N];
const ll Inf = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, q;
cin >> n >> q;
vector <int> d(n + 1);
for (int i = 1; i <= n; ++i) cin >> d[i];
d[0] = 1;
++n;
int m;
{
vector <pair <int, int>> seg;
int lst = 0;
for (int i = 1; i < n; ++i) {
if (d[i] > d[lst]) {
seg.push_back({lst, i - 1});
lst = i;
}
}
seg.push_back({lst, n - 1});
for (int i = 0; i < min(K, (int)seg.size()); ++i) {
L[i] = seg[i].first;
R[i] = seg[i].second;
}
m = min(K, (int)seg.size());
_time[0] = 1;
for (int i = 1; i < min(K, (int)seg.size()); ++i) {
int a = L[i - 1];
int b = L[i];
ll t = (ll)_time[i - 1] * (d[b] + d[a] - 1) / d[a];
t = min(t, Inf);
_time[i] = t;
}
}
while (q--) {
int t, l, r;
cin >> t >> l >> r;
int ans = 0;
for (int i = 0; i < m; ++i) {
int cnt = t / _time[i];
ll pl = -L[i], pr = -R[i];
pl += (ll)cnt * d[L[i]];
pr += (ll)cnt * d[L[i]];
swap(pl, pr);
pl = max(pl, (ll)l);
pr = min(pr, (ll)r);
ans += max(0LL, pr - pl + 1);
}
cout << ans << '\n';
}
}
Compilation message
worst_reporter3.cpp:17:10: error: '::main' must return 'int'
int main() {
^
