Train Swapping
来源:互联网 发布:上海银行淘宝金卡年费 编辑:程序博客网 时间:2024/06/08 18:29
train swappers
At an old railway station, you may still encounter one of the last remaining ``train swappers''. A train swapper is an employee of the railroad, whose sole job it is to rearrange the carriages of trains.
Once the carriages are arranged in the optimal order, all the train driver has to do, is drop the carriages off, one by one, at the stations for which the load is meant.
The title ``train swapper'' stems from the first person who performed this task, at a station close to a railway bridge. Instead of opening up vertically, the bridge rotated around a pillar in the center of the river. After rotating the bridge 90 degrees, boats could pass left or right.
The first train swapper had discovered that the bridge could be operated with at most two carriages on it. By rotating the bridge 180 degrees, the carriages switched place, allowing him to rearrange the carriages (as a side effect, the carriages then faced the opposite direction, but train carriages can move either way, so who cares).
Now that almost all train swappers have died out, the railway company would like to automate their operation. Part of the program to be developed, is a routine which decides for a given train the least number of swaps of two adjacent carriages necessary to order the train. Your assignment is to create that routine.
Input Specification
The input contains on the first line the number of test cases (N). Each test case consists of two input lines. The first line of a test case contains an integer L, determining the length of the train ( ). The second line of a test case contains a permutation of the numbers 1 through L, indicating the current order of the carriages. The carriages should be ordered such that carriage 1 comes first, then 2, etc. with carriage L coming last.
Output Specification
For each test case output the sentence: 'Optimal train swapping takes S swaps.' where S is an integer.
Example Input
331 3 244 3 2 122 1
Example Output
Optimal train swapping takes 1 swaps.Optimal train swapping takes 6 swaps.Optimal train swapping takes 1 swaps.
题目大意:给定一列乱序的车厢,相邻的两节可调换,求最少要交换多少次才能把其调整为1.....n的顺序。
解决方案:这题很简单,先把最小的调到第一个位置,第二小到第二位置.....,最后得到的次数就是最优的。
#include<iostream>using namespace std;int main(){ int rain[55]; int T,n; cin>>T; while(T--) { cin>>n; int cnt=0; for(int i=0;i<n;i++) cin>>rain[i]; for(int i=1;i<=n;i++) { for(int j=0;j<n;j++) { if(rain[j]==i) { for(int k=j;k>=i;k--) { int temp=rain[k];rain[k]=rain[k-1];rain[k-1]=temp;cnt++; } break; } } } cout<<"Optimal train swapping takes "<<cnt<<" swaps."<<endl; } return 0;}
- Train Swapping
- UVa 299 Train Swapping
- Uva 299 Train Swapping
- uva 299 Train Swapping
- UVA 299 - Train Swapping
- 299 - Train Swapping
- UVA 299-Train Swapping
- UVa 299 - Train Swapping
- uva299 - Train Swapping
- uva-299 - Train Swapping
- 299 - Train Swapping
- UVa 299 - Train Swapping
- UVaOJ 299 - Train Swapping
- UVa 299 - Train Swapping
- 299 - Train Swapping
- 299 - Train Swapping
- UVa 299 - Train Swapping
- UVA 299 Train Swapping
- UVa 699 - The Falling Leaves
- Android中Looper, Handler, MessageQueue的理解
- 庞果网之高斯公式
- JSON 数据格式解析
- Spring JDBC 教程 - Spring MVC
- Train Swapping
- C++内存分布
- Poj11520 Fill the sqare
- 修改控件Spinner内容的字体大小 颜色等属性
- 总结用户控件和注册控件
- C++动态分配数组
- spring 下载地址
- Eclipse快捷键大全
- select 非阻塞模式 服务器 代码