結果

問題 No.878 Range High-Element Query
ユーザー uwiuwi
提出日時 2019-09-06 21:40:44
言語 Java21
(openjdk 21)
結果
AC  
実行時間 330 ms / 2,000 ms
コード長 3,942 bytes
コンパイル時間 7,863 ms
コンパイル使用メモリ 81,104 KB
実行使用メモリ 65,848 KB
最終ジャッジ日時 2023-09-06 23:15:08
合計ジャッジ時間 7,806 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
49,460 KB
testcase_01 AC 48 ms
49,520 KB
testcase_02 AC 50 ms
51,392 KB
testcase_03 AC 44 ms
47,868 KB
testcase_04 AC 48 ms
49,248 KB
testcase_05 AC 54 ms
50,548 KB
testcase_06 AC 44 ms
49,508 KB
testcase_07 AC 42 ms
47,576 KB
testcase_08 AC 54 ms
50,340 KB
testcase_09 AC 53 ms
49,420 KB
testcase_10 AC 47 ms
49,432 KB
testcase_11 AC 330 ms
64,816 KB
testcase_12 AC 239 ms
65,848 KB
testcase_13 AC 281 ms
64,544 KB
testcase_14 AC 222 ms
61,952 KB
testcase_15 AC 240 ms
64,696 KB
testcase_16 AC 262 ms
63,176 KB
testcase_17 AC 276 ms
65,340 KB
testcase_18 AC 261 ms
63,196 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest190906;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class D {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), Q =ni();
		int[] a = na(n);
		
		int[] f = enumNextWall(a);
		for(int i = 0;i < n;i++){
			if(f[i] >= n)f[i] = -1;
		}
		int[][] sn = sparseNext(f);
		
		for(int z = 0;z < Q;z++){
			ni();
			int l = ni()-1, r = ni()-1;
			int ret = 0;
			for(int d = sn.length-1;d >= 0;d--){
				if(sn[d][l] == -1 || sn[d][l] > r){
				}else{
					l = sn[d][l];
					ret += 1<<d;
				}
			}
			out.println(ret+1);
		}
	}
	
	
	
	public static int[] enumNextWall(int[] a)
	{
		int n = a.length;
		int[] L = new int[n];
		for(int i = n-1;i >= 0;i--){
			L[i] = i+1;
			while(L[i] < n && a[L[i]] < a[i])L[i] = L[L[i]];
		}
		return L;
	}
	
	public static int[][] sparseNext(int[] f)
	{
		int n = f.length;
		final int m = 18; // 
		int[][] sf = new int[m][n];
		sf[0] = Arrays.copyOf(f, n);
		for(int i = 1;i < m;i++){
			for(int j = 0;j < n;j++){
				sf[i][j] = sf[i-1][j] == -1 ? -1 : sf[i-1][sf[i-1][j]];
			}
		}
		return sf;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new D().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0