void function1(int * A, FILE * inp, int N)
{
	//use dynamic allocation for array B so it goes on the heap instead of stack malloc(N*sizeof(int));
	int B[N];
	int count=0;
	int pos=0;
	int j=0;
	int k=0;
	int origj;

	while(count<N)
	   	{
		pos=count;
		
			if(pos==N-1)
			{
				B[pos]=pos;
				break;
			}
			
			while(A[pos]>=A[count+1])
			{
				count++;
				
				if(count==N)
				{					
					break;
				}
				
			}
			
			if(count<N)
				B[pos]=count+1;
			else
				B[pos]=count;
			
			count=pos+1;
			
		}

		//printarray(B, N);
		
		count=0;
		while(fscanf(inp, "%i", &j)==1&&fscanf(inp, "%i", &k)==1)
		{
		origj=j;
			while(B[j]<=k)
			{
				j=B[j];
				
				if(j==B[j])
				{
					break;
				}
			}
			
			//printf("%i %i = %i\n", origj, k,j);
		}
			 
}