P3654

#include<bits/stdc++.h>
#define smc 0
using namespace std;
int main(){
    int r,c,k,len = 0,ans = 0; cin>>r>>c>>k;
    char grou[r][c];
    for(int i = 0;i < r;i++)
        for(int j = 0;j < c;j++)
            cin>>grou[i][j];
    for(int i = 0;i < r;i++)
        for(int j = 0;j < c;j++){
            if(grou[i][j] == '.') len++;
            if(grou[i][j] == '#' || j == c - 1){
              		#if smc == 2
    			cout<<len<<endl;
    			#endif
                if(len >= k) ans += len - k + 1;
                len = 0;
            }
        }
    #if smc == 1
    cout<<ans<<endl;
    #endif
    if(k == 1){
        cout<<ans;
		return 0;
    }
    for(int j = 0;j < c;j++){
    	for(int i = 0;i < r;i++){
    		if(grou[i][j] == '.') len++;
            if(grou[i][j] == '#' || i == r - 1){
                if(len > k) ans += len - k + 1;
                len = 0;
            }  
		}
	}
	cout<<ans;
    return 0;
}

WA30

代码是按照题解思路写的，但是只有30分，样例可过