CCF CSP刷题记录35——202006-2稀疏向量（Java）

这道题用Java容易超时，然后解决的办法是输入用BufferedReader,用hashmap代替定义数组，只定义一个hashmap即可。

import java.util.Scanner;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.StringTokenizer;
 
class Reader {
    static StringTokenizer token =new StringTokenizer("");
    static BufferedReader reader   =new BufferedReader (new InputStreamReader(System.in)) ;
    static String nextLine() throws IOException {
        return reader.readLine() ;
    }
    static  String next() throws IOException {
        while(!token.hasMoreTokens()) {
            token =new StringTokenizer(reader.readLine()) ;
        }
        return token.nextToken() ;
    }
 
    static int nextInt() throws IOException {
        return Integer.parseInt(next()) ;
    }
    static double nextDouble() throws IOException {
        return Double.parseDouble(next()) ;
    }
 
}

public class 稀疏向量 {

	public static void main(String[] args) throws IOException {
		 
	        int n = Reader.nextInt();
	        int a= Reader.nextInt();
	        int b= Reader.nextInt();
	        long res=0L;
	        /*运行超时了 才30分
	        int[][] v1=new int[2][a];
	        int[][] v2=new int[2][b];
	        for(int i=0;i map=new HashMap();
	       for(int i=0;i