Mai intai trebuie sa te autentifici.

Cod sursa(job #2147992)

Utilizator sergiudnyTritean Sergiu sergiudny Data 1 martie 2018 14:02:04
Problema A+B Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.12 kb
#include <bits/stdc++.h>
#define DM 505
#define pb push_back
using namespace std;
ifstream fin("tort3.in");
ofstream fout("tort3.out");

bitset<DM>viz[DM];
int n,m;
struct slic{ int i,j,lg; };
vector<slic>v;
char mt[DM][DM];

struct nod{
    int l,c;

    int getSquare(){
        return min(l,c);
    }

    void parc(int x,int y){
        int lg=getSquare();
        for(int i=x-lg;i<=x;++i) for(int j=y-lg;j<=y;++j)
            viz[i][j]=true;
    }

    void add(int i,int j){
        v.pb({i,j,getSquare()});
    }
}dp[DM][DM];

bool cmp(slic a, slic b){
    if(a.lg==b.lg){
        if(a.i==b.i)
            return a.j<b.j;
        return a.i<b.i;
    }
    return a.lg<b.lg;
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;++i)
        fin>>(mt[i]+1);
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j)
            dp[i][j]={1,1};
            if(mt[i-1][j]==mt[i][j]){
                dp[i][j]={max(dp[i-1][j].l,dp[i][j].l),
                          max(dp[i-1][j].c,dp[i][j].c)};
            }
            if(mt[i][j-1]==mt[i][j]){

            }
    }
    return 0;
}