80分求挑错

Chen_Py @ 2018-08-09 08:40:11

#include<bits/stdc++.h>
using namespace std;
bool a[2502][2502];
int sl[2502][2502],su[2502][2502];
int n,m;
void init()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            scanf("%d",&a[i][j]);
            sl[i][j]=sl[i][j-1]+a[i][j];
            su[i][j]=su[i-1][j]+a[i][j];
        }
    }
    return;
}
int ansl[2502][2502];
int ansr[2502][2502];
void do_it()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(ansl[i-1][j-1]&&a[i][j]&&sl[i][j]-sl[i][j-ansl[i-1][j-1]-1]==1&&su[i][j]-su[i-ansl[i-1][j-1]-1][j]==1)
            {
                ansl[i][j]=ansl[i-1][j-1]+1;
            }
            else if(a[i][j])
            {
                ansl[i][j]=1;
            }
            if(ansr[i-1][j+1]&&a[i][j]&&sl[i][j+ansr[i-1][j+1]]-sl[i][j-1]==1&&su[i][j]-su[i-ansr[i-1][j+1]-1][j]==1)
            {
                ansr[i][j]=ansr[i-1][j+1]+1;
            }
            else if(a[i][j])
            {
                ansr[i][j]=1;
            }
        }
    }
    return;
}
int main()
{
    init();
    do_it();
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
//            cout<<ansr[i][j]<<" ";
            ans=max(ans,max(ansl[i][j],ansr[i][j]));
        }
//        cout<<endl;
    }
    for(int i=1;i<=10;i++)
    {
        for(int j=356;j<=365;j++)
        {
            cout<<a[i][j]<<" ";
        }
        cout<<endl;
    }
    cout<<ans<<endl;
    return 0;
}

by RoderickQiu @ 2018-08-09 08:51:57

然而你这些是什么

 for(int i=1;i<=10;i++)
    {
        for(int j=356;j<=365;j++)
        {
            cout<<a[i][j]<<" ";
        }
        cout<<endl;
    }

明明

输出格式：
只有一个整数——猫猫一口下去可以吃掉的鱼的数量，占一行，行末有回车。

by hellomath @ 2018-08-09 08:54:25

你怎么得 80 分的

by Chen_Py @ 2018-08-09 08:58:15

@larryzhong 调试痕迹没删。。。 尴尬，这是80分以后调的 请自行忽略

by Chen_Py @ 2018-08-09 09:02:41

@RoderickQiu

#include<bits/stdc++.h>
using namespace std;
bool a[2502][2502];
int sl[2502][2502],su[2502][2502];
int n,m;
void init()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            scanf("%d",&a[i][j]);
            sl[i][j]=sl[i][j-1]+a[i][j];
            su[i][j]=su[i-1][j]+a[i][j];
        }
    }
    return;
}
int ansl[2502][2502];
int ansr[2502][2502];
void do_it()
{
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            if(ansl[i-1][j-1]&&a[i][j]&&sl[i][j]-sl[i][j-ansl[i-1][j-1]-1]==1&&su[i][j]-su[i-ansl[i-1][j-1]-1][j]==1)
            {
                ansl[i][j]=ansl[i-1][j-1]+1;
            }
            else if(a[i][j])
            {
                ansl[i][j]=1;
            }
            if(ansr[i-1][j+1]&&a[i][j]&&sl[i][j+ansr[i-1][j+1]]-sl[i][j-1]==1&&su[i][j]-su[i-ansr[i-1][j+1]-1][j]==1)
            {
                ansr[i][j]=ansr[i-1][j+1]+1;
            }
            else if(a[i][j])
            {
                ansr[i][j]=1;
            }
        }
    }
    return;
}
int main()
{
    init();
    do_it();
    int ans=0;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
//            cout<<ansr[i][j]<<" ";
            ans=max(ans,max(ansl[i][j],ansr[i][j]));
        }
//        cout<<endl;
    }
    cout<<ans<<endl;
    return 0;
}

by matsuk @ 2018-08-19 19:44:23

巧巧巧我也是！！

by _QYC_ @ 2018-10-16 19:58:41

4 4
1 0 1 0
0 1 0 0
1 0 1 0
0 0 0 1

标准输出：3

by 陌尘缘_怜 @ 2018-10-29 16:50:58

@GQYC

谢大佬