第24届ccf202112-1序列查询(JAVA)

最新推荐文章于 2024-04-18 11:22:18 发布

sohoAPI

最新推荐文章于 2024-04-18 11:22:18 发布

阅读量197

点赞数

分类专栏：算法文章标签： java 开发语言后端

本文链接：https://blog.csdn.net/m0_52712579/article/details/122526848

版权

算法专栏收录该内容

12 篇文章 0 订阅

订阅专栏

题目

代码

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

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 Main{
    public static void main(String[] args) throws IOException {
        int n = Reader.nextInt();
        int N = Reader.nextInt();
        int a[] = new int[n + 1];
        int s = 0;
        int c = 0;
        for (int i = 1; i <= n; i++) {
            a[i] = Reader.nextInt();
        }
        for (int i = 0; i < n; i++) {
            c = a[i + 1] - a[i];
            s += i * c;
        }
        System.out.println(s + n * (N - a[n]));
    }
}