import java.util.ArrayList;
public class PlantVisibilityProblems {
public static void main(String args[])
{
ArrayList <Integer> alist=new ArrayList <Integer>();
alist.add(50);
alist.add(25);
alist.add(41);
alist.add(11);
System.out.println(alist);
int n=alist.size();
for (int i=0;i<n;i++)
{
boolean vis=true;
for (int j=i;j<n-1;j++)
{
if (alist.get(i)>alist.get(j+1))
{
vis=true;
}
else
{
vis=false;
System.out.println("Tree with height "+alist.get(i) + " is not visible");
break;
}
}
if (vis)
{
System.out.println("Tree with height "+alist.get(i) + " is visible");
}
vis=true;
}
}
}
public class PlantVisibilityProblems {
public static void main(String args[])
{
ArrayList <Integer> alist=new ArrayList <Integer>();
alist.add(50);
alist.add(25);
alist.add(41);
alist.add(11);
System.out.println(alist);
int n=alist.size();
for (int i=0;i<n;i++)
{
boolean vis=true;
for (int j=i;j<n-1;j++)
{
if (alist.get(i)>alist.get(j+1))
{
vis=true;
}
else
{
vis=false;
System.out.println("Tree with height "+alist.get(i) + " is not visible");
break;
}
}
if (vis)
{
System.out.println("Tree with height "+alist.get(i) + " is visible");
}
vis=true;
}
}
}