Cod sursa(job #1796069)

Utilizator Dragos1998Dragos Radu Dragos1998 Data 3 noiembrie 2016 08:10:36
Problema Cel mai lung subsir comun Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.16 kb
#include<fstream>
using namespace std;
int n, a[3][20001],maxx,im,jm;
ifstream fin("m.in");
ofstream fout("m.out");
void Read();
void Write();

int main()
{
    Read();
    Write();
    fin.close();
    fout.close();
    return 0;
}

void Read()
{
    int i,j,m,x;
    fin>>n;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=n; j++)
        {
            fin>>x;
            if(i==1) a[i][j]=x;
            else
            {
                if(x==0) a[2][j]=0;
                else if(j==1) a[2][j]=x;
                else
                {
                    m=a[1][j-1];
                    if(a[1][j]<m) m=a[1][j];
                    if(a[2][j-1]<m) m=a[2][j-1];
                    a[2][j]=m+1;
                    if(a[2][j]>maxx)
                    {
                        maxx=a[2][j];
                        im=i;
                        jm=j;
                    }
                }
            }
            a[1][j-1]=a[2][j-1];
        }
        a[1][n]=a[2][n];
    }
}

void Write()
{
   /* for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
    {
        fout<<a[i][j]<<" ";
        fout<<'\n';
    }*/
}