题解 | #小红的区间查询#

#include <stdio.h>
#include <stdlib.h>
int main() {
    int n, q;
    if (scanf("%d %d", &n, &q) != EOF) {
        // printf("n is %d q is %d\n", n, q);
        int* a = (int*)malloc(sizeof(int) * n);
        for(int i = 0; i < n; i++) {
            scanf("%d", &a[i]);
        }
        int op, i ,x;
        for(int time = 0; time < q; time++) {
            scanf("%d %d %d", &op, &i, &x);
            // printf("%d %d %d\n", op, i, x);
            if(op == 1) { // 代表是修改操作
                a[i - 1] = x;
            } else if(op == 2) { // 查询操作
                int count = 0;
                for(int j = 0; j < i; j++) {
                    if(a[j] == x) count++;
                }
                printf("%d\n", count);
            } else {
                printf("error2");
            }
        }
        free(a);
    } else {
        printf("error");
    }
    return 0;
}