제출 #344840

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
344840	2021-01-06 15:58:35	dimashii	Money (IZhO17_money)	C++17	45 / 100	1591 ms	58952 KiB

money

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e6 + 123;
int A[mxN], B[mxN], f[mxN], R[mxN];
void Upd(int pos) {
  for (int i = pos; i < mxN; i |= i + 1) ++f[i];
}
int Get(int pos) {
  int ans = 0;
  for (int i = pos; i >= 0; i &= i + 1, --i) ans += f[i];
  return ans;
}
int Count(int l, int r) {
  if (l > r) return 0;
  return Get(r) - Get(l - 1);
}
int main() {
  ios_base :: sync_with_stdio(false); cin.tie(nullptr); 
  int N; cin >> N;
  for (int i = 1; i <= N; ++i) cin >> A[i];
  R[N] = N;
  for (int i = N - 1; i > 0; i--) {
    if (A[i] <= A[i + 1]) R[i] = R[i + 1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 0 / 55