蓝桥杯--灵能传输(92%)--java--2个超时

最新推荐文章于 2024-08-18 21:36:31 发布

一只小余

最新推荐文章于 2024-08-18 21:36:31 发布

阅读量82

点赞数

分类专栏：算法题文章标签： java 蓝桥杯 c++

本文链接：https://blog.csdn.net/qq_56717234/article/details/129934825

版权

算法题专栏收录该内容

34 篇文章 1 订阅

订阅专栏

该Java代码读取输入，使用StreamTokenizer处理整数，然后计算并存储数组元素的累加和。接着，它找出数组中的最小和最大值，对数组进行排序，并构建一个新的数组，保留奇数索引的元素。最后，程序计算新数组中相邻元素的最大差值并输出结果。

摘要由CSDN通过智能技术生成


import java.io.*;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    static final StreamTokenizer st = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));

    public static int nextInt() throws IOException {
        st.nextToken();
        return (int) st.nval;
    }

    public static long nextLong() throws IOException {
        st.nextToken();
        return (long) st.nval;
    }


    public static void main(String[] args) throws IOException {
        int t = nextInt();
        for (int k = 0; k < t; k++) {
            int n = nextInt();
            long[] a = new long[n + 1];
            for (int i = 1; i <= n; i++) {
                a[i] = nextInt() + a[i - 1];
            }
//            for (int i = 1; i <= n; i++) {
//                a[i] = nextInt();
//            }
//            Arrays.parallelPrefix(a, Long::sum);
            long n0 = Math.min(a[0], a[n]);
            long nn = Math.max(a[0], a[n]);
            Arrays.sort(a);
            int s0 = 0,sn = 0;
            for (int i = 0; i < n + 1; i++) {
                if (a[i] == n0) {
                    s0 = i;
                    break;
                }
            }
            for (int i = n; i >= 0; i--) {
                if (a[i] == nn) {
                    sn = i;
                    break;
                }
            }
            long ans = 0;
            long[] b = new long[n + 1];
            boolean[] f = new boolean[n + 1];
            int l = 0, r = n;
            for (int i = s0; i >= 0; i -= 2) {
                b[l++] = a[i];
                f[i] = true;
            }
            for (int i = sn; i <= n; i += 2) {
                b[r--] = a[i];
                f[i] = true;
            }
            for (int i = 0; i <= n; i++) {
                if (!f[i])
                    b[l++] = a[i];
            }
            for (int i = 1; i <= n; i++) {
                ans = Math.max(ans,Math.abs(b[i]-b[i-1]));
            }
            System.out.println(ans);
        }
    }


}