显示原始代码
#include <stdio.h>
long long partition(long long arr[], long long low, long long high) {
long long pivot = arr[high];
long long i = low - 1;
for (long long j = low; j < high; j++) {
if (arr[j] < pivot) {
i++;
long long temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
long long temp = arr[i + 1];
arr[i + 1] = arr[high];
arr[high] = temp;
return i + 1;
}
void quickSort(long long arr[], long long low, long long high) {
if (low < high) {
long long pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
long long delete (long long *a, long long l, long long r) {
long long len = r - l + 1;
long long b[len];
for (long long i = 0; i < len; i++) {
b[i] = a[l - 1 + i];
}
quickSort(b, 0, len - 1);
for (long long i = 0; i < len - 1; i++) {
if (b[i] == b[i + 1]) {
for (long long j = i; j < len - 1; j++) {
b[j] = b[j + 1];
}
len--;
i--;
}
}
return len;
}
int main() {
long long n, q, l, r;
scanf("%lld%lld", &n, &q);
long long a[n];
long long res[q];
for (long long i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (long long i = 0; i < q; i++) {
scanf("%lld%lld", &l, &r);
res[i] = delete (a, l, r);
}
for (long long i = 0; i < q; i++) {
printf("%lld\n", res[i]);
}
}