제출 #633521

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
633521	2022-08-22 16:36:17	Arinoor	Bubble Sort 2 (JOI18_bubblesort2)	C++17	0 / 100	5702 ms	1572 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 "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
#define all(x)      x.begin(), x.end()
#define pb        push_back
#define mp        make_pair
#define fi        first
#define se        second
#define bug(x)      cerr << #x << " : " << x << '\n'
typedef pair<int, int> pii;
const int maxn = 2e5 + 10;
int n, q;
int a[maxn];
int solve(){
  vector<pii> S;
  for(int i = 0; i < n; i ++){
    S.pb(mp(a[i], i));
  }
  sort(all(S));
  int ans = 0;
  int c = 0;
  for(int i = 0; i < n; i ++){
    c ++;
    if(i == n - 1 or S[i].se < S[i + 1].se){
      ans = max(ans, c);
      c = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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