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

小红的区间查询

https://www.nowcoder.com/practice/cbaecf16197a4136b8a593a7a270f4ab

import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main {
    static int N = 210;
    static int[] a = new int[N];

    static void solve() {
        int n=in.nextInt(),q=in.nextInt();
        for(int i=1;i<=n;i++) {
            a[i] = in.nextInt();
        }
        while(q-->0) {
            int op = in.nextInt(),k = in.nextInt(), x = in.nextInt();
            if(op==1) {
                a[k]=x;
            }else{
                int ans=0;
                for(int i=1;i<=k;i++) {
                    if(a[i]==x) ans++;
                }
                out.println(ans);
            }
        }
    }

    public static void main(String[] args) {
        solve();
        out.flush();
    }

    static FastReader in = new FastReader();
    static PrintWriter out = new PrintWriter(System.out);

    static class FastReader {
        static BufferedReader br;
        static StringTokenizer st;

        FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            String str = "";
            while(st==null||!st.hasMoreElements()) {
                try {
                    str = br.readLine();
                } catch(IOException e) {
                    throw new RuntimeException(e);
                }
                st = new StringTokenizer(str);
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }
}

全部评论

相关推荐

美丽的查理斯不讲武德:包kpi的啊,感觉虾皮一点hc都没有
点赞 评论 收藏
分享
点赞 收藏 评论
分享
牛客网
牛客企业服务