【NOIP2008】【Luogu1058】立体图

problem

solution

codes

#include<iostream>
#include<cstdio>
using namespace std;
int m,n,a[1001][1001],ma[1001],maxx,maxy;
int z[6]={2,1,0,0,0,0},s[6]={6,6,6,6,5,4};
char c[1001][1001],c1[10][10]={
"  +---+",
" /   /|",
"+---+ |",
"|   | +",
"|   |/",
"+---+",
};
void fg(int x,int y){
    int i,j;
    for(int i=5;i>=0;i--){
        for(int j=z[i];j<=s[i];j++){
            c[5-i+x][j+y]=c1[i][j];
            if(5-i+x>maxx) maxx=5-i+x;
            if(j+y>maxy) maxy=j+y;
        }
    }
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=0;j<m;j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)
        for(int j=0;j<m;j++)
            for(int k=0;k<a[i][j];k++)
                fg((n-i)*2+1+3*k,(n-i)*2+1+4*j);
    for(int i=maxx;i>=1;i--){
        for(int j=1;j<=maxy;j++){
            if(c[i][j]=='\000') cout<<".";
            else printf("%c",c[i][j]);
        }
        cout<<"\n";
    }
}

转载于:https://www.cnblogs.com/gwj1314/p/9444688.html