#include<bits/stdc++.h>
#define int long long
using namespace std;
int INF = numeric_limits<int>::max()/2;
int32_t main() {
int n,q;
cin>> n >> q;
vector<int>arr(n);
for(int i = 0; i < n; i++){
cin >> arr[i];
}
while(q--){
int l,r;
cin >> l >> r;
l--;r--;
vector<int> cur;
for(int i = l; i <= r; i++){
cur.push_back(arr[i]);
}
sort(cur.begin(),cur.end());
int mi = INF;
do{
int sum = 0;
for(int i = 0; i < cur.size(); i++){
for(int j = i; j < cur.size(); j++){
set<int> occ;
for(int k = i; k <= j; k++){
occ.insert(cur[k]);
}
sum += occ.size();
}
}
mi = min(mi,sum);
}while(next_permutation(cur.begin(),cur.end()));
cout << mi << endl;
}
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |