Compilare: main.cpp: In function 'int z(int)': main.cpp:3:208: warning: no return statement in function returning non-void [-Wreturn-type] 3 | using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const int h=4e4;int p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;vector<int> e[h];int z(int x){a[x]=++d;for(int y:e[x])z(y);b[x]=++d;}int k(int x,int y){L(a[x]<=a[y]&&b[y]<=b[x]);}int o(int x,int y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}int main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=2;i<=n;i++){f>>x>>y;t[y][0]=x;e[x].push_back(y);}for(i=1;i<=n;i++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c||q==c&&x<s||q==c&&x==s&&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ^ main.cpp: In function 'int main()': main.cpp:3:622: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 3 | using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const int h=4e4;int p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;vector<int> e[h];int z(int x){a[x]=++d;for(int y:e[x])z(y);b[x]=++d;}int k(int x,int y){L(a[x]<=a[y]&&b[y]<=b[x]);}int o(int x,int y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}int main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=2;i<=n;i++){f>>x>>y;t[y][0]=x;e[x].push_back(y);}for(i=1;i<=n;i++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c||q==c&&x<s||q==c&&x==s&&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~~~~^~~~~ main.cpp:3:639: warning: suggest parentheses around '&&' within '||' [-Wparentheses] 3 | using namespace std;ifstream f("concurs.in");ofstream g("concurs.out");const int h=4e4;int p[h],a[h],b[h],t[h][16],n,m,x,y,r,c,d,q,s,u,i,j;vector<int> e[h];int z(int x){a[x]=++d;for(int y:e[x])z(y);b[x]=++d;}int k(int x,int y){L(a[x]<=a[y]&&b[y]<=b[x]);}int o(int x,int y){if(k(x,y))L x;if(k(y,x))L y;for(i=15;i>=0;i--)if(!k(t[x][i],y))x=t[x][i];L t[x][0];}int main(){f>>n>>m;for(i=1;i<=n;i++)f>>p[i];for(i=2;i<=n;i++){f>>x>>y;t[y][0]=x;e[x].push_back(y);}for(i=1;i<=n;i++)if(!t[i][0])r=i;for(j=1;j<16;j++)for(i=1;i<=n;i++){t[i][j]=t[t[i][j-1]][j-1];if(!t[i][j])t[i][j]=r;}z(r);while(m--){f>>x>>y;c=p[o(x,y)];if(q<c||q==c&&x<s||q==c&&x==s&&y<u)q=c,s=x,u=y;}g<<q<<' '<<s<<' '<<u;} | ~~~~~~~~~~^~~~~