UVA Problem 299 train swap Solution

Problem Solving, UVa

 

#include <bits/stdc++.h>



 using namespace std;

int main()

{

  int n, array[5000],k, c,count,d,T, t;



  while(cin>>T)

  {

     

      for(k=0;k<T;k++)

      {

     

      cin>>n;

    count=0;

    for (c = 0; c < n; c++)

       {

        cin>>array[c];

       }



      for (c = 1 ; c <= n - 1; c++) {

    d = c;

    

    while ( d > 0 && array[d] < array[d-1]) {

        count++;

      t          = array[d];

      array[d]   = array[d-1];

      array[d-1] = t;



      d--;

    }

  }





    printf("Optimal train swapping takes %d swaps.\n",count);

 

}

     

  }

 



  return 0;

}

 

0 Comments

You may find interest following article

Complete Guide: Create Laravel Project in Docker Without Local Dependencies

, , , | 0 Comments

Create Laravel Project Through Docker — No Need to Install PHP, MySQL, or Apache on Your Local Machine In this tutorial, I’ll show you how to create and run a full Laravel project using Docker containers. That means you won’t have to install PHP, MySQL, or Apache locally on your computer. By the end of this guide, you’ll have a fully functional Laravel development...