【DP】撿蘋果

來源:互聯網
上載者:User

標籤:

#include<stdio.h>int max(int a,int b){    int c;    if(a>b)        c=a;    else        c=b;            return c;    }int main(){    FILE *fin,*fout;    int a[8][8],i,j;        fin=fopen("in.txt","r");    fout=fopen("out.txt","w");        for(i=0;i<=5;i++)        for(j=0;j<=5;j++)            a[i][j]=0;                for(i=0;i<=4;i++)        for(j=0;j<=i;j++)            fscanf(fin,"%d",&a[i][j]);                for(;i>=0;i--)        for(j=0;j<=i;j++)            a[i][j]=max(a[i-1][j],a[i-1][j+1]);                fprintf(fout,"%d\n",a[0][0]);        fclose(fin);    fclose(fout);    getchar();    getchar();    return 0;}

 

【DP】撿蘋果

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.