結果
問題 | No.992 最長増加部分列の数え上げ |
ユーザー | 37zigen |
提出日時 | 2020-02-15 22:32:12 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 1,209 ms / 2,000 ms |
コード長 | 4,148 bytes |
コンパイル時間 | 3,421 ms |
コンパイル使用メモリ | 78,404 KB |
実行使用メモリ | 96,520 KB |
最終ジャッジ日時 | 2024-04-16 03:21:00 |
合計ジャッジ時間 | 34,773 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
36,868 KB |
testcase_01 | AC | 59 ms
36,820 KB |
testcase_02 | AC | 60 ms
36,344 KB |
testcase_03 | AC | 58 ms
36,492 KB |
testcase_04 | AC | 556 ms
67,336 KB |
testcase_05 | AC | 380 ms
55,012 KB |
testcase_06 | AC | 609 ms
69,172 KB |
testcase_07 | AC | 463 ms
65,948 KB |
testcase_08 | AC | 313 ms
53,288 KB |
testcase_09 | AC | 467 ms
66,184 KB |
testcase_10 | AC | 594 ms
68,944 KB |
testcase_11 | AC | 690 ms
69,260 KB |
testcase_12 | AC | 257 ms
48,776 KB |
testcase_13 | AC | 449 ms
65,784 KB |
testcase_14 | AC | 441 ms
66,032 KB |
testcase_15 | AC | 258 ms
48,640 KB |
testcase_16 | AC | 1,036 ms
94,312 KB |
testcase_17 | AC | 284 ms
52,644 KB |
testcase_18 | AC | 444 ms
66,112 KB |
testcase_19 | AC | 649 ms
69,464 KB |
testcase_20 | AC | 1,130 ms
96,520 KB |
testcase_21 | AC | 1,178 ms
96,364 KB |
testcase_22 | AC | 1,166 ms
95,820 KB |
testcase_23 | AC | 1,209 ms
96,304 KB |
testcase_24 | AC | 1,165 ms
96,176 KB |
testcase_25 | AC | 1,151 ms
96,352 KB |
testcase_26 | AC | 1,125 ms
96,320 KB |
testcase_27 | AC | 1,140 ms
96,152 KB |
testcase_28 | AC | 1,131 ms
96,116 KB |
testcase_29 | AC | 1,153 ms
96,472 KB |
testcase_30 | AC | 678 ms
91,172 KB |
testcase_31 | AC | 674 ms
91,260 KB |
testcase_32 | AC | 675 ms
91,684 KB |
testcase_33 | AC | 681 ms
91,288 KB |
testcase_34 | AC | 672 ms
90,956 KB |
testcase_35 | AC | 681 ms
91,308 KB |
testcase_36 | AC | 695 ms
91,488 KB |
testcase_37 | AC | 665 ms
90,968 KB |
testcase_38 | AC | 674 ms
91,160 KB |
testcase_39 | AC | 681 ms
91,540 KB |
testcase_40 | AC | 701 ms
90,968 KB |
testcase_41 | AC | 718 ms
91,416 KB |
testcase_42 | AC | 692 ms
91,424 KB |
testcase_43 | AC | 713 ms
91,308 KB |
testcase_44 | AC | 717 ms
91,428 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.util.Arrays; import java.util.Comparator; import java.util.HashMap; import java.util.Map; import java.util.NoSuchElementException; class Main { public static void main(String[] args) throws Exception { new Main().run(); } class SegTree{ int n; long[][] v; public SegTree(int n_) { n=1; while(n<n_)n*=2; v=new long[2*n-1][2];//最長増加列の長さ,最長増加列の個数 } void update(int k,long[] val) { k+=n-1; v[k]=merge(v[k],val); while(k>0) { k=(k-1)/2; v[k]=merge(v[2*k+1], v[2*k+2]); } } long[] query(int a,int b) { return query(0,n,a,b,0); } long[] query(int l,int r,int a,int b,int k) { if(a<=l&&r<=b)return v[k]; else if(r<=a||b<=l)return new long[] {0,0}; else { long[] lv=query(l,(l+r)/2,a,b,2*k+1); long[] rv=query((l+r)/2,r,a,b,2*k+2); return merge(lv,rv); } } long[] merge(long[] a,long[] b) { long[] ret=new long[2]; ret[0]=Math.max(a[0], b[0]); if(ret[0]==a[0])ret[1]+=a[1]; if(ret[0]==b[0])ret[1]+=b[1]; ret[1]%=M; return ret; } } long[] shrink(long[] a) { long[] x=new long[a.length]; long[] ret=new long[a.length]; for(int i=0;i<a.length;++i) { x[i]=(a[i]<<32)|i; } Arrays.sort(x); int p=0; for(int i=0;i<x.length;++i) { int j=i; ret[(int)x[i]]=p; while(j+1<x.length&&(x[i]>>32)==(x[j+1]>>32)) { ++j; ret[(int)x[j]]=p; } i=j; ++p; } return ret; } final long M=(long)1e9+7; //最長増加列の長さ,最長増加列の個数 void run() { Scanner sc=new Scanner(); int N=sc.nextInt(); long[] A=new long[N]; for(int i=0;i<N;++i) { A[i]=sc.nextLong()+(long)1e9; } SegTree seg=new SegTree(N); A=shrink(A); for(int i=0;i<N;++i) { long[] v=seg.query(0, (int)A[i]); v[0]++; if(v[1]==0) v[1]=1; seg.update((int)A[i], v); } System.out.println(seg.query(0, N)[1]); } static void tr(Object... objects) { System.out.println(Arrays.deepToString(objects)); } } class Scanner { private final InputStream in = 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;} public 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());} }