This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "bubblesort2.h"
using namespace std;
#define pb push_back
std::vector<int> countScans(std::vector<int> A,std::vector<int> X,std::vector<int> V){
int Q=X.size();
std::vector<int> answer;
int n=A.size();
int dp[A.size()];
dp[0]=0;
for(int i=1;i<n;i++){
dp[i]=0;
for(int j=i-1;j>=0;j--){
if(A[j]>A[i])
dp[i]++;
}
}
for(int i=0;i<Q;i++){
dp[X[i]]=0;
for(int j=X[i]-1;j>=0;j--){
if(A[j]>V[i])
dp[X[i]]++;
}
for(int j=X[i]+1;j<n;j++){
if(V[i]>A[j] && A[j]>=A[X[i]])
dp[j]++;
else{
if(V[i]<=A[j] && A[X[i]]>A[j])
dp[j]--;
}
}
A[X[i]]=V[i];
answer.pb(*max_element(dp,dp+n));
}
return answer;
}
# | 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... |