| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 332302 | 2020-12-02T02:22:59 Z | YJU | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h>
#include "bubblesort2.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=1e5+5;
const ll K=350;
const ld pi=acos(-1);
const ll INF=(1LL<<60);
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
vector<ll> countScans(vector<ll> A,vector<ll> x,vector<ll> V){
vector<ll> ans;
REP(i,SZ(x)){
A[x[i]]=V[i];
vector<pll> a;
ll res=0;
REP(i,SZ(A))a.pb(mp(A[i],i));
sort(a.begin(),a.end());
REP(j,SZ(a))res=max(res,abs(a[i].Y-i));
ans.pb(res);
}
return ans;
}