結果

問題 No.711 競技レーティング単調増加
ユーザー uwiuwi
提出日時 2018-06-29 23:04:04
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,369 bytes
コンパイル時間 4,259 ms
コンパイル使用メモリ 78,304 KB
実行使用メモリ 56,732 KB
最終ジャッジ日時 2023-09-13 15:35:10
合計ジャッジ時間 9,494 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,376 KB
testcase_01 AC 42 ms
49,236 KB
testcase_02 AC 40 ms
49,532 KB
testcase_03 AC 41 ms
49,244 KB
testcase_04 AC 42 ms
49,576 KB
testcase_05 AC 41 ms
49,276 KB
testcase_06 AC 42 ms
50,708 KB
testcase_07 AC 42 ms
49,176 KB
testcase_08 AC 40 ms
49,088 KB
testcase_09 AC 43 ms
49,176 KB
testcase_10 AC 42 ms
49,408 KB
testcase_11 AC 40 ms
49,256 KB
testcase_12 AC 42 ms
49,272 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 AC 82 ms
52,000 KB
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 85 ms
52,252 KB
testcase_40 WA -
testcase_41 AC 42 ms
49,340 KB
testcase_42 AC 104 ms
52,244 KB
testcase_43 AC 118 ms
52,180 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest180629;
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 F3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		
		int[] b = new int[n];
		int p = 0;
		for(int i = 0;i < n;i++){
			if(a[i]-i >= 1){
				b[p++] = a[i];
			}
		}
		
		out.println(p - lis(Arrays.copyOf(b, p)) + (n-p));
	}
	
	public static int lis(int[] in)
	{
		int n = in.length;
		int ret = 0;
		int[] h = new int[n + 1];
		Arrays.fill(h, Integer.MIN_VALUE / 2);
		for(int i = 0;i < n;i++){
			int ind = Arrays.binarySearch(h, 0, ret + 1, in[i]);
			if(ind < 0){
				ind = -ind-2;
			}
			h[ind+1] = in[i];
			if(ind >= ret)ret++;
		}
		return ret;
	}

	
	public static int[] lise(int[] in)
	{
		int n = in.length;
		int ret = 0;
		int[] h = new int[n + 1];
		Arrays.fill(h, Integer.MIN_VALUE / 2);
		int[] rets = new int[n];
		for(int i = 0;i < n;i++){
			int ind = upperBound(h, 0, ret+1, in[i]);
			rets[i] = h[ind] == in[i] ? ind : ind+1;
			h[ind+1] = in[i];
			if(ind >= ret)ret++;
		}
		return rets;
	}
	
	public static int upperBound(int[] a, int v){ return upperBound(a, 0, a.length, v); }
	public static int upperBound(int[] a, int l, int r, int v)
	{
		int low = l-1, high = r;
		while(high-low > 1){
			int h = high+low>>>1;
			if(a[h] <= v){
				low = h;
			}else{
				high = h;
			}
		}
		return low;
	}
	


	
	public static int[] rev(int[] a)
	{
		int[] b = new int[a.length];
		for(int i = 0;i < a.length;i++)b[a.length-1-i] = a[i];
		return b;
	}

	
	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 F3().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