結果

問題 No.2648 [Cherry 6th Tune D] 一次元の馬
ユーザー AsahiAsahi
提出日時 2024-02-23 22:20:04
言語 Java21
(openjdk 21)
結果
AC  
実行時間 483 ms / 2,000 ms
コード長 5,619 bytes
コンパイル時間 3,029 ms
コンパイル使用メモリ 79,724 KB
実行使用メモリ 64,280 KB
最終ジャッジ日時 2024-09-29 07:10:31
合計ジャッジ時間 12,180 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 117 ms
53,112 KB
testcase_01 AC 257 ms
56,656 KB
testcase_02 AC 190 ms
56,112 KB
testcase_03 AC 187 ms
56,088 KB
testcase_04 AC 209 ms
56,596 KB
testcase_05 AC 218 ms
56,804 KB
testcase_06 AC 203 ms
56,748 KB
testcase_07 AC 218 ms
56,864 KB
testcase_08 AC 200 ms
56,772 KB
testcase_09 AC 200 ms
56,296 KB
testcase_10 AC 190 ms
56,128 KB
testcase_11 AC 199 ms
56,556 KB
testcase_12 AC 200 ms
56,404 KB
testcase_13 AC 189 ms
56,508 KB
testcase_14 AC 190 ms
56,448 KB
testcase_15 AC 190 ms
56,200 KB
testcase_16 AC 207 ms
56,384 KB
testcase_17 AC 193 ms
56,500 KB
testcase_18 AC 193 ms
56,516 KB
testcase_19 AC 188 ms
56,352 KB
testcase_20 AC 192 ms
56,364 KB
testcase_21 AC 206 ms
56,240 KB
testcase_22 AC 192 ms
56,540 KB
testcase_23 AC 210 ms
56,768 KB
testcase_24 AC 179 ms
56,400 KB
testcase_25 AC 196 ms
56,224 KB
testcase_26 AC 202 ms
56,464 KB
testcase_27 AC 205 ms
56,672 KB
testcase_28 AC 190 ms
56,308 KB
testcase_29 AC 190 ms
56,596 KB
testcase_30 AC 205 ms
56,540 KB
testcase_31 AC 183 ms
56,200 KB
testcase_32 AC 189 ms
56,284 KB
testcase_33 AC 192 ms
56,400 KB
testcase_34 AC 190 ms
56,564 KB
testcase_35 AC 483 ms
64,280 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; 
import java.io.*;
import java.math.*;
import java.util.stream.*;
import java.util.function.*;

class Main implements Runnable {

    public void solve() {    
        int t = in.nextInt() ;
        while(t-->0) {
            int n = in.nextInt();
            long [] a = in.nextLong(n);
            long l = -1 , r = (long) 1e9;
            while(r - l > 1) {
                long mid = (l + r) / 2 ;
                boolean inc = true ;
                for(int i = 0 ; i < n - 1; i ++) {
                    if((a[i] + ((mid) * (i + 1))) >= (a[i + 1] + ((mid) * (i + 2)))) inc = false ;
                }
                if(inc) r = mid ;
                else l = mid ;
            }
            out.println(r);
        }
    }

    /******/



    /******/
    
    public PrintWriter out = new PrintWriter(System.out);
    public In in = new In() ;
    public static final int  inf = (1  << 30);
    public static final long lnf = (1L << 60);
    public static final String yes = "Yes" , no  = "No" ;
    public static final int mod7 = 1000000007 , mod9 = 998244353;
    public static final int [] dy4 = {-1,0,1,0} , dx4 = {0,1,0,-1};
    public static final int [] dy8 = {-1,-1,-1,0,1,1,1,0} , dx8 = {-1,0,1,1,1,0,-1,-1};

    public static void main(String ... args) { new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); }
    public void run() { solve(); out.flush(); }

}

class In {

    private final InputStream in = System.in;
    private final Scanner sc = new Scanner(System.in);
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() { 
        if (hasNextByte()) return buffer[ptr++]; else return -1;
    }

    private static boolean isPrintableChar(int c) { 
        return 33 <= c && c <= 126;
    }

    private  boolean hasNext() { 
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++; 
        }
        return hasNextByte();
    }
    
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }

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

    public char nextChar() {
        return next().charAt(0);
    }

    public BigInteger nextBigInteger() {
        return sc.nextBigInteger();
    }

    public int [] nextInt(int n) {
        int [] array = new int[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextInt();
        }
        return array ;
    }

    public int [][] nextInt(int n , int m) {
        int [][] array = new int[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextInt(m);
        }
        return array ;
    }

    public long [] nextLong(int n) {
        long [] array = new long[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextLong();
        }
        return array ;
    }

    public long [][] nextLong(int n , int m) {
        long [][] array = new long[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextLong(m);
        }
        return array ;
    }

    public double [] nextDouble(int n) {
        double [] array = new double[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextDouble();
        }
        return array ;
    }
    
    public String [] next(int n) {
        String [] array = new String[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = next();
        }
        return array ;
    }

    public String [][] next(int n , int m) {
        String [][] array = new String[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = next(m);
        }
        return array ;
    }

    public char [] nextChar(int n) {
        char [] array = new char[n];
        String string = next() ;
        for(int i = 0 ; i < n ; i ++) {
            array[i] = string.charAt(i);
        }
        return array ;
    }

    public char [][] nextChar(int n , int m) {
        char [][] array = new char[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextChar(m);
        }
        return array ;
    }

}
0