#102098 (C++11) No.390 最長の数列

• 問題: No.390 最長の数列
• ユーザー: LayCurse
• 提出日時: 2016-07-08 22:40:55
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 57 ms / 5,000 ms
• コード長: 2,451 bytes
• コンパイル時間: 1,224 ms
• コンパイル使用メモリ: 159,696 KB
• 実行使用メモリ: 13,000 KB
• 最終ジャッジ日時: 2024-10-02 10:30:00
• 合計ジャッジ時間: 2,171 ms
• ジャッジサーバーID （参考情報）: judge4 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	5 ms; 7,496 KB
testcase_01	AC	4 ms; 7,496 KB
testcase_02	AC	6 ms; 7,624 KB
testcase_03	AC	5 ms; 7,492 KB
testcase_04	AC	5 ms; 7,624 KB
testcase_05	AC	6 ms; 6,824 KB
testcase_06	AC	57 ms; 11,468 KB
testcase_07	AC	4 ms; 7,496 KB
testcase_08	AC	3 ms; 6,820 KB
testcase_09	AC	5 ms; 7,500 KB
testcase_10	AC	16 ms; 11,972 KB
testcase_11	AC	17 ms; 11,976 KB
testcase_12	AC	16 ms; 11,208 KB
testcase_13	AC	16 ms; 12,744 KB
testcase_14	AC	33 ms; 7,880 KB
testcase_15	AC	3 ms; 7,500 KB
testcase_16	AC	4 ms; 9,672 KB
testcase_17	AC	8 ms; 12,228 KB
testcase_18	AC	8 ms; 13,000 KB

コンパイルメッセージ

main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~

ソースコード

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

char memarr[17000000]; void *mem = memarr;
#define MD 1000000007

int N, X[1000001], dp[1000001];

int main(){
  int i, j, k;
  int res = 0;

  reader(&N);
  while(N--){
    reader(&k);
    X[k] = 1;
  }

  rep(i,1000001) if(X[i]){
    dp[i] = max(dp[i], 1);
    for(j=2*i;j<=1000000;j+=i) if(X[j]){
      dp[j] = max(dp[j], dp[i]+1);
    }
    res = max(res, dp[i]);
  }

  writerLn(res);

  return 0;
}