제출 #1138271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138271		Pwo	Fish 3 (JOI24_fish3)	C++20	28 / 100	390 ms	101924 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, d, q, a[300005], pre[300005], ans[300005];
pair<int, int> up[300005][19];
pair<pair<int, int>, int> qu[300005];

int32_t main() {
	ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	cin >> n >> d;
	for (int i = 1 ; i <= n; i++) {
		cin >> a[i];
		pre[i] = pre[i - 1] + a[i];
	}
	for (int i = 0; i <= n; i++) for (int j = 0; j <= 18; j++) up[i][j] = {0, 0};
	vector<int> st;
	for (int i = n; i >= 1; i--) {
		while (!st.empty() && a[st.back()] > a[i]) {
			up[st.back()][0] = {i, pre[st.back()] - pre[i] - a[st.back()] * (st.back() - i)};
			st.pop_back();
		}
		st.push_back(i);
	}
	for (int i = 1; i <= n; i++)
		for (int j = 1; j <= 18; j++)
			up[i][j] = {up[up[i][j - 1].first][j - 1].first,
				up[i][j - 1].second + up[up[i][j - 1].first][j - 1].second};
	cin >> q;
	for (int i = 0; i < q; i++) {
		int l, r; cin >> l >> r; int ans = 0;
		for (int i = 18; i >= 0; i--)
			if (up[r][i].first >= l)
				ans += up[r][i].second, r = up[r][i].first;
		ans += pre[r] - pre[l - 1] - a[r] * (r - l + 1);
		cout << ans << '\n';
	}	
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 7
• Subtask 3: 28 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36