結果

問題 No.992 最長増加部分列の数え上げ
コンテスト
ユーザー uwi
提出日時 2020-02-14 21:36:56
言語 Java
(openjdk 23)
結果
AC  
実行時間 433 ms / 2,000 ms
コード長 5,712 bytes
コンパイル時間 5,345 ms
コンパイル使用メモリ 85,376 KB
実行使用メモリ 48,576 KB
最終ジャッジ日時 2024-10-06 10:54:53
合計ジャッジ時間 19,905 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 42
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200214;
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 E {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		out.println(countLIS(a, 1000000007));
	}
	
	public static int[] shrink(int[] a)
	{
		int n = a.length;
		long[] b = new long[n];
		for(int i = 0;i < n;i++)b[i] = (long)a[i]<<32|i;
		Arrays.sort(b);
		int[] ret = new int[n];
		int p = 0;
		for(int i = 0;i < n;i++) {
			if(i>0 && (b[i]^b[i-1])>>32!=0)p++;
			ret[(int)b[i]] = p;
		}
		return ret;
	}

	
	public static long countLIS(int[] a, int mod)
	{
		if(mod == 1)return 0;
		a = shrink(a);
		int n = a.length;
		SegmentTreeRMQSumWhenMax st = new SegmentTreeRMQSumWhenMax(n+1, mod);
		st.updateOrAdd(0, 0, 1); // shifted by 1
		for(int i = 0;i < n;i++){
			int max = st.maxx(0, a[i]+1); // <=a[i]
			st.updateOrAdd(a[i]+1, max+1, (int)st.gw);
		}
		return st.w[1];
	}
	
	private static class SegmentTreeRMQSumWhenMax {
		public int M, H, N;
		public int[] st;
		public int[] w;
		public int mod;
		
		public SegmentTreeRMQSumWhenMax(int n, int mod)
		{
			N = n;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			w = new int[M];
			this.mod = mod;
			Arrays.fill(st, 0, M, Integer.MIN_VALUE);
		}
		
		public SegmentTreeRMQSumWhenMax(int[] a, int mod)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			st = new int[M];
			w = new int[M];
			for(int i = 0;i < N;i++){
				st[H+i] = a[i];
			}
			this.mod = mod;
			Arrays.fill(st, H+N, M, Integer.MIN_VALUE);
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		// if x equals to before st[H+pos], +y, else update y
		public void updateOrAdd(int pos, int x, int y)
		{
			if(x < st[H+pos])throw new RuntimeException("x < st[H+pos]");
			if(x == st[H+pos]){
				w[H+pos] += y;
				if(w[H+pos] >= mod)w[H+pos] -= mod;
			}else{
				st[H+pos] = x;
				w[H+pos] = y; // y % mod
			}
			for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i);
		}
		
		private void propagate(int i)
		{
			if(st[2*i] < st[2*i+1]){
				st[i] = st[2*i+1];
				w[i] = w[2*i+1];
			}else if(st[2*i] > st[2*i+1]){
				st[i] = st[2*i];
				w[i] = w[2*i];
			}else{
				st[i] = st[2*i];
				w[i] = w[2*i] + w[2*i+1];
				if(w[i] >= mod)w[i] -= mod;
			}
		}
		
		public long gw;
		
		public int maxx(int l, int r){
			gw = 0;
			if(l >= r)return 0;
			int max = Integer.MIN_VALUE;
			while(l != 0){
				int f = l&-l;
				if(l+f > r)break;
				int v = st[(H+l)/f];
				if(v > max){
					max = v;
					gw = w[(H+l)/f];
				}else if(v == max){
					gw += w[(H+l)/f];
				}
				l += f;
			}
			
			while(l < r){
				int f = r&-r;
				int v = st[(H+r)/f-1];
				if(v > max){
					max = v;
					gw = w[(H+r)/f-1];
				}else if(v == max){
					gw += w[(H+r)/f-1];
				}
				r -= f;
			}
			gw %= mod;
			return max;
		}
	}
	
	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 E().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