# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1111733 | zxcigan | Fish 3 (JOI24_fish3) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(time(0));
using ll = long long;
#define int long long
const int N = 2e5 + 1;
void solve() {
int n, d; cin >> n >> d;
vector<int> c(n + 1), pref (n + 1);
for (int i = 1; i <= n; ++i) {
cin >> c[i];
pref[i] = pref[i - 1] + c[i];
}
int q; cin >> q;
vector<int> mxl (n + 1);
for (int i = 1; i <= n; ++i) {
if (c[i]) mxl[i] = mxl[i - 1] + 1;
}
while (q--) {
int l, r; cin >> l >> r;
int ans = 0;
while (r >= l) {
if (!a[r]) break;
r --;
}