閱讀443 返回首頁    go 阿裏雲 go 技術社區[雲棲]


騰訊馬拉鬆 第三場 1003 小小明係列故事——遊戲的煩惱 大水題

  比賽的時候看錯題意了,其實是個大水題

  隻用把每個點和(0,0)之前的和算出來,然後枚舉左上角即可


/*
author:jxy
lang:C/C++
university:China,Xidian University
**If you need to reprint,please indicate the source**
*/
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#define INF 1E9
using namespace std;
int sum[2001][2003];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m)&&n+m)
    {
        int x,y;
        scanf("%d%d",&x,&y);
        int i,j;
        getchar();
        memset(sum,0,sizeof(sum));
        for(i=1;i<=n;i++,getchar())
         for(j=1;j<=m;j++)
         {
             if(getchar()=='*')
             {
                 sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1]+1;
             }
             else sum[i][j]=sum[i-1][j]+sum[i][j-1]-sum[i-1][j-1];
         }
        int ans=0;
        for(i=0;i<n;i++)
         for(j=0;j<m;j++)
         {
             if(i+x<=n&&j+y<=m&&sum[i+x][j+y]+sum[i][j]-sum[i+x][j]-sum[i][j+y]==(x*y))ans++;
             if(x!=y&&i+y<=n&&j+x<=m&&sum[i+y][j+x]+sum[i][j]-sum[i+y][j]-sum[i][j+x]==(x*y))ans++;
         }
        printf("%d\n",ans);
    }
}


最後更新:2017-04-03 21:30:13

  上一篇:go Java線程池架構原理和源碼解析(ThreadPoolExecutor)
  下一篇:go POJ 1474 半麵相交