제출 #420297

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
420297	2021-06-08 09:09:49	IOrtroiii	Financial Report (JOI21_financial)	C++14	0 / 100	1004 ms	40792 KiB

Main

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;
 
int main() {
  ios_base::sync_with_stdio(false); cin.tie(nullptr);
 
  int N, D; cin >> N >> D;
  vector<int> A(N); for (int &a : A) cin >> a;
  
  vector<int> ord(N); iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](const int &i, const int &j) { 
    return make_pair(A[i], -i) < make_pair(A[j], -j); 
  });
  int S = 1;
  while (S < N) S *= 2;
  vector<int> loc(N);
  for (int i = 0; i < N; ++i) loc[ord[i]] = i;
 
  struct Node {
    int best = 0;
    int pref = 0;
    int suff = 0;
    bool all = false;
  };
 
  auto merge = [&](Node l, Node r) {
    Node ans;
    ans.all = l.all & r.all;
    ans.best = max({l.best, r.best, l.suff + r.suff});
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 14
• Subtask 2: 0 / 14
• Subtask 3: 0 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35