本蒟蒻纯前缀和只有30分,剩下WA是为什么

P1387 最大正方形

``` if ((s[i+k-1][j+k-1]-s[i+k-1][j-1]-s[i-1][j+k-1])==k*k) ``` 是不是这句的问题
by zhutier @ 2018-11-02 20:57:33


#include<cstdio> #include<algorithm> using namespace std; int n,m; int k; int a[101][101]; int maxx; int main() { scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { scanf("%d",&k); if(k) { a[i][j]=min(a[i-1][j],min(a[i-1][j-1],a[i][j-1]))+1; } if(a[i][j]>maxx) { maxx=a[i][j]; } } } printf("%d\n",maxx); return 0; }
by nobalei @ 2019-03-11 20:52:38


|