[U]3.4.4 3維DP

來源:互聯網
上載者:User

終於會寫DP了,這種水水的還是能寫的~ 嘿嘿~

/*ID:bysenLANG:C++PROG:rockers*/#include<stdio.h>using namespace std;int DP[21][21][21];int time[21];int N,T,M; int max( int a,int b ){ return a>b?a:b; }int getDP( int k,int t,int j ){ int ret=0; for( int i=0;i<j;i++ )  ret=max( DP[k][t][i],ret );return ret;}int getCD( int cd,int k ){ int ret=0; for( int i=1;i<=T;i++ ) for( int j=0;j<k;j++ )  ret=max(ret,DP[cd][i][j] );return ret;}int main(){ freopen( "rockers.in","r",stdin ); freopen( "rockers.out","w",stdout ); scanf( "%d %d %d",&N,&T,&M ); for( int i=1;i<=N;i++ )  scanf( "%d",&time[i] );for( int k=1;k<=M;k++ )for( int i=1;i<=T;i++ )for( int j=1;j<=N;j++ ){  if( i-time[j]==0)    DP[k][i][j]=1;  if( i-time[j]>=0 )  {   if( (i-time[j])%T==0 )    DP[k][i][j]=max( DP[k][i][j],getCD(k-1,j)+1 );   else    DP[k][i][j]=max( DP[k][i][j],getDP(k,i-time[j],j)+1 );         } } /* for( int k=1;k<=M;k++ ){  for( int i=1;i<=T;i++ ) {    for( int j=1;j<=N;j++ )      printf( "%d  ",DP[k][i][j] );   printf( "\n" );   }   printf( "\n" );    }*/    int ans=0;    for( int i=0;i<=T;i++ )    for( int j=0;j<=N;j++ )     ans=max( ans,DP[M][i][j] );printf( "%d\n",ans );}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.