洛谷 三月月赛 A

模拟模拟

 #include<bits/stdc++.h>
 using namespace std;
 inline int ra()
 {
     int x=,f=; char ch=getchar();
     while (ch<'' || ch>'') {if (ch=='-') f=-; ch=getchar();}
     while (ch>='' && ch<='') {x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 bool mp[][];
 int n,m,k,ans,tot;
 int main()
 {
     n=ra(); m=ra(); k=ra();
     for (int i=; i<=n; i++)
     {
         char ch[];
         scanf("%s",ch+);
         for (int j=; j<=m; j++)
             if (ch[j]=='.') mp[i][j]=,tot++;
     }
     if (k==)
     {
         cout<<tot<<endl;
         return ;
     }
     for (int i=; i<=n; i++)
     {
         int last=;
         for (int j=; j<=m+; j++)
             if (!mp[i][j]) ans+=max(last-k+,),last=;
             else last++;
     }
     for (int j=; j<=m; j++)
     {
         int last=;
         for (int i=; i<=n+; i++)
             if (!mp[i][j]) ans+=max(last-k+,),last=;
             else last++;
     }
     cout<<ans<<endl;
     return ;
 }