Compilare: user.cpp: In function ‘int main()’: user.cpp:3:1087: warning: ‘y’ may be used uninitialized in this function [-Wmaybe-uninitialized] using namespace std;ifstream fin("vila.in");ofstream fout("vila.out");const int nmax = 151;int N,M,dp[nmax][nmax],s,best,v[nmax][nmax],op[nmax][nmax],k[nmax*nmax];bool a[nmax][nmax];inline int Valid(int i,int j){if(i < 1 || j < 1 || i > N || j > M)return false;return true;}inline void Fill(int i,int j,int x,int z,int nr){if(!Valid(i,j)||v[i][j]>=z||a[i][j])return;dp[i][j] = x;++v[i][j];op[i][j] = nr;++s;Fill(i+1,j,x,z,nr); Fill(i-1,j,x,z,nr); Fill(i,j+1,x,z,nr); Fill(i,j-1,x,z,nr);}int main(){int i,j,q,nr=0,x,y,b[5];char ch;fin >> N >> M;for(i = 1; i <= N; ++i)for(j = 1; j <= M; ++j){fin >> ch;if(ch == '1') a[i][j] = 1;}fin.close();for(i = 1; i <= N; ++i)for(j = 1; j <= M; ++j)if(!dp[i][j]&&!a[i][j]){s = 0;++nr;Fill(i,j,0,1,nr);q=s;best = max(best,s);Fill(i,j,q,2,nr);k[nr] = q;}fout << nr <<'\n' << best <<'\n';best = 0;for(i = 1; i <= N; ++i)for(j = 1; j <= M; ++j)if(a[i][j]){b[1]=op[i-1][j];b[2]=op[i+1][j];b[3]=op[i][j-1];b[4]=op[i][j+1];sort(b+1,b+5);s = k[b[1]];for(int x = 2; x <= 4; ++x)if(b[x]!=b[x-1])s+=k[b[x]];if(s > best)best = s,x=i,y=j;}++best;fout <<x <<' '<<y <<' '<< best <<'\n';fout.close();return 0;} ^ user.cpp:3:1078: warning: ‘x’ may be used uninitialized in this function [-Wmaybe-uninitialized] using namespace std;ifstream fin("vila.in");ofstream fout("vila.out");const int nmax = 151;int N,M,dp[nmax][nmax],s,best,v[nmax][nmax],op[nmax][nmax],k[nmax*nmax];bool a[nmax][nmax];inline int Valid(int i,int j){if(i < 1 || j < 1 || i > N || j > M)return false;return true;}inline void Fill(int i,int j,int x,int z,int nr){if(!Valid(i,j)||v[i][j]>=z||a[i][j])return;dp[i][j] = x;++v[i][j];op[i][j] = nr;++s;Fill(i+1,j,x,z,nr); Fill(i-1,j,x,z,nr); Fill(i,j+1,x,z,nr); Fill(i,j-1,x,z,nr);}int main(){int i,j,q,nr=0,x,y,b[5];char ch;fin >> N >> M;for(i = 1; i <= N; ++i)for(j = 1; j <= M; ++j){fin >> ch;if(ch == '1') a[i][j] = 1;}fin.close();for(i = 1; i <= N; ++i)for(j = 1; j <= M; ++j)if(!dp[i][j]&&!a[i][j]){s = 0;++nr;Fill(i,j,0,1,nr);q=s;best = max(best,s);Fill(i,j,q,2,nr);k[nr] = q;}fout << nr <<'\n' << best <<'\n';best = 0;for(i = 1; i <= N; ++i)for(j = 1; j <= M; ++j)if(a[i][j]){b[1]=op[i-1][j];b[2]=op[i+1][j];b[3]=op[i][j-1];b[4]=op[i][j+1];sort(b+1,b+5);s = k[b[1]];for(int x = 2; x <= 4; ++x)if(b[x]!=b[x-1])s+=k[b[x]];if(s > best)best = s,x=i,y=j;}++best;fout <<x <<' '<<y <<' '<< best <<'\n';fout.close();return 0;} ^