#include "bubblesort2.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V)
{
vector<pair<int,int>> v;
vector<int> sol;
for(int i=0;i<X.size();i++)
{
v.clear();
A[X[i]] = V[i];
for(int j=0;j<A.size();j++)
v.push_back({A[j],j});
sort(v.begin(),v.end());
int mxm=0;
for(int j=0;j<v.size();j++)
mxm = max(mxm, abs(j - v[j].second));
sol.push_back(mxm);
}
return sol;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |