제출 #1138676

#제출 시각아이디문제언어결과실행 시간메모리
1138676stucknightFish 3 (JOI24_fish3)C++20
0 / 100
2092 ms2836 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n, d; cin >> n >> d; int fish[n]; for (int i = 0; i < n; i++) { int c; cin >> c; fish[i] = c; } int q; cin >> q; while (q--) { int l, r; cin >> l >> r; int range[n]; int cnt = 0; int min = 1e9; for (int j = l - 1; j < r; j++) { if (min > fish[j]) { min = fish[j]; } range[cnt] = fish[j]; cnt++; } for (int k = 0; k < r - l + 1; k++) { range[k] = range[k] - min; } int cnt2 = 1; int temp = r-l; int prev = range[temp]; for (int i = temp - 1; i>= 0; i--) { if (range[i] == prev) { cnt2++; } else { break; } } int sum = 0; for (int j = 0; j < r-l+1-cnt2; j++) { sum += range[j]; } cout << sum << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...