if(Orig[i] > Sub[j-1])
   Then insert Orig[i] into Sub[j]

#include <iostream>
#include<ctime>
using namespace std;
int main()
{
    int n,i,i1,j,max,m,sum,k,u;
//array
 
cout<< " Enter the size of array : ";
cin>>n;
int a[n];
 
srand(time(0));
for(i=0;i<n;i++)
{
 a[i]=rand()%20;
 cout<<a[i]<<" ";
 
 }
cout<<endl;
cout<<endl;
cout<<endl;
//-------------------------------------------------
m=0;//for counting how many sub arrays
max=0;//max number of sub arrays
int h=0;//for breaking the line when condition does does not satisfy
for(i=0;i<n-1;i++)
{ 
 for(j=i+1;j<n;j++) 
 {              
  if((a[i]<=a[j]))
  {
   m=m+1;
   cout<<a[i]<<" ";
  }
  else
    {
    if(m>max)
    {
 
    max=m;        
    m=0; 
    h=h+1;
    if(h>0)
  {
   cout<<endl;       
  }       
 
  }else{
  m=0;
  if(h>0)
  {
   cout<<endl;       
  }       
 
      }            
 
  }     
 
 }   
}
 cout<<endl;
 cout<<"the long sub array has : ";
 cout<<max;
cout<<endl;
 
 
system("pause");
return 0;
}

// Initialize the necessary variables first.
for(i=0;i<n-1;) // i should run only till last but 1 element and you don't know how much to increment i
{
   x=i;y=i+1;m=1; // Temporary variables x and y to hold values m set to 1
   while(a[x]<=a[y] && y<n) // This loop finds out the length of the next sub array
   {
        m=m+1;
        x=x+1;
        y=y+1;
   }
   if(m>max) max=m;//If the length found > max then this value is maximum
   if(m>1) // Print sub array only if length > 1
   {
        // Printing the sub array where starting index is i and ending index is y
        for(j=i;j<=x;j++) cout<<a[j]<<" "; 
        cout<<endl<<endl;
   }
   i=i+m; // Increment i with the sub array length
   // Above step reduces the looping and increases efficiency and also it prevents 
   // the printing and finding of sub array of sub arrays
   // That is in a sequence 1 2 3 4 5 it prints 1 2 3 4 5 and quits and not
   // 1
   // 1 2
   // 1 2 3 and all upto 1 2 3 4 5
   // Because even though they satisfy the condition they are not really required.
}