int n=1000000;
int arr[n],p=1;
for(int i=0;i<n/2;i++)arr[i]=p++;
for(int i=n/2;i<n;i++)arr[i]=p--;

for (int i =0; i <= count1; ++i){
            for (int j = 0; j <= count2; ++j){
                temp = (arr[indices_grow[i]] + arr[indices_decay[j]]);
                temp =temp*(indices_decay[j] - indices_grow[i]);
                if (crossing_sol < temp){
                    crossing_sol = temp;
                }
            }
        }