提出 #74221110

---

ソースコード 拡げる

import java.io.*;
import java.util.*;

public class Main {
    static class BinaryIndexedTree {
        int size;
        long[] array;
        public BinaryIndexedTree(int size) {
            this.size = size;
            array = new long[size + 1];
        }
        public void update(int idx, int val) {
            for (idx++; idx <= size; idx += idx & -idx) {
                array[idx] += val;
            }
        }
        public long query(int idx) {
            long sum = 0;
            for (idx++; idx > 0; idx -= idx & -idx) {
                sum += array[idx];
            }
            return sum;
        }
        public long query(int lef, int rig) {
            if (lef > rig) return 0;
            return query(rig) - query(lef - 1);
        }
    }
    public static void main(String[] args) {
        InputReader reader = new InputReader(System.in);
        PrintWriter writer = new PrintWriter(System.out, false);
        int N = reader.nextInt();
        int M = reader.nextInt();
        long K = reader.nextLong();
        int[] A = new int[N];
        for (int i = 0; i < N; i++) {
            A[i] = reader.nextInt();
        }
        long[] B = new long[N + 1];
        for (int i = 0; i < N; i++) {
            B[i + 1] = B[i] + A[i] + M;
        }
        long[] C = compressArray(B);
        int size = C.length;
        long result = 0;
        BinaryIndexedTree binaryIndexedTree = new BinaryIndexedTree(size + 1);
        binaryIndexedTree.update(lowerBound(C, B[0]), 1);
        for (int r = 1; r <= N; r++) {
            int l = lowerBound(C, B[r] - K);
            result += binaryIndexedTree.query(l, size);
            binaryIndexedTree.update(lowerBound(C, B[r]), 1);
        }
        writer.println(result);
        writer.close();
        System.exit(0);
    }

    private static long[] compressArray(long[] B) {
        TreeSet<Long> set = new TreeSet<>();
        for (long ele : B) {
            set.add(ele);
        }
        long[] C = new long[set.size()];
        int idx = 0;
        for (long ele : set) {
            C[idx++] = ele;
        }
        return C;
    }

    private static int lowerBound(long[] A, long X) {
        int low = 0, high = A.length;
        while (low < high) {
            int mid = (high + low) / 2;
            if (A[mid] < X) low = mid + 1;
            else high = mid;
        }
        return low;
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
        public String nextLine() {
            String str = "";
            try {
                str = reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}

提出情報

ジャッジ結果