蓝桥杯历届真题：地宫取宝C++代码优化.pdfVIP

C++

#pragmacomment(linker,/STACK:102400000,102400000)

#includealgorithm

#includeiostream

//#includefstream

#includeclimits

#includecstdlib

#includecstring

#includestring

#includevector

#includecstdio

#includequeue

#includestack

#includecmath

#includelist

#includeset

#includemap

#definesfscanf

#definepfprintf

#definefstfirst

#definescdsecond

#definepbpush_back

#definemkpmake_pair

#definecls(a,x)memset(a,x,sizeofa)

#definedt(x)cout#x=x;

#definedte(x)cout#x=xendl;

#if(defined(_WIN32)||defined(__WIN32__))

typedef__int64LL;

typedefunsigned__int64ULL;

#definellI64

#else

typedeflonglongLL;

typedefunsignedlonglongULL;

#defineI64ll

#endif

usingnamespacestd;

temteclassTinlinevoidscaf(Tv)

{

charch;

while(ch=getchar())

if(ch=9ch=0)break;

v=ch-0;

while(ch=getchar())

if(ch=9ch=0)v=(v1)+(v3)+ch-0;

elsebreak;

}

typedefpairint,intPII;

constintMX=50100;

constintmod=1000000007;

intsp[51][51];

intg[51][51];

LLdp[51][51][13];

inlinevoidrun()

{

intn,m,k,i,j,ii,jj,kk;

scanf(%d%d%d,n,m,k);

for(i=1;i=50;++i)

sp[i][1]=sp[1][i]=1;

for(i=2;i=n;++i)

for(j=2;j=m;++j)

sp[i][j]=sp[i-1][j]+sp[i][j-1];

for(i=1;i=n;++i)

{

for(j=1;j=m;++j)

{

scanf(%d,g[i][j]);

dp[i][j][1]=sp[i][j];

}

}

for(i=1;i=n;++i)

{

for(j=1;j=m;++j)

{

for(ii=1;ii=i;++ii)

{

for(jj=1;jj=j;++jj)

{

if(g[ii][jj]g[i][j])

{

for(kk=2;kk=k;++kk)