제출 #94091

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
94091	2019-01-15 23:23:54	tincamatei	Bubble Sort 2 (JOI18_bubblesort2)	C++14	0 / 100	6 ms	1144 KiB

bubblesort2

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>
#include "bubblesort2.h"
using namespace std;
const int MAX_N = 8000;
vector<int> a;
int maxpref[MAX_N], minsuff[MAX_N];
int badsegtree[MAX_N];
void update(int poz, int val, int n) {
  maxpref[0] = a[0];
  for(int i = 1; i < n; ++i)
    maxpref[i] = max(maxpref[i - 1], a[i]);
  minsuff[n - 1] = a[n - 1];
  for(int i = n - 2; i >= 0; --i)
    minsuff[i] = min(minsuff[i + 1], a[i]);
  for(int i = 0; i < poz; ++i)
    if(maxpref[i] > a[poz])
      badsegtree[i] += val;
  for(int i = poz; i < n - 1; ++i)
    if(a[poz] > minsuff[i])
      badsegtree[i] += val;
}
int getInv(int n) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 17
• Subtask 2: 0 / 21
• Subtask 3: 0 / 22
• Subtask 4: 0 / 40