UVa 299 Train Swapping (冒泡排序的次数)
来源:互联网 发布:希拉里 坐牢 知乎 编辑:程序博客网 时间:2024/05/22 13:57
299 - Train Swapping
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=98&page=show_problem&problem=235
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.
冒泡排序的次数。
完整代码:
/*0.013s*/#include<cstdio>#include<algorithm>using namespace std;int num[55];int main(void){int t, l, count;scanf("%d", &t);while (t--){count = 0;scanf("%d", &l);for (int i = 0; i < l; ++i)scanf("%d", &num[i]);for (int i = 0; i < l; ++i)for (int j = i + 1; j < l; ++j)if (num[i] > num[j]){swap(num[i], num[j]);++count;}printf("Optimal train swapping takes %d swaps.\n", count);}return 0;}
- UVa 299 Train Swapping (冒泡排序的次数)
- UVA Train Swapping(冒泡排序的次数)
- UVA 299- Train Swapping(冒泡排序中交换次数)
- UVA 299 - Train Swapping(冒泡排序)
- UVA 299 Train Swapping(冒泡排序)
- uva 299 Train Swapping(模拟冒泡排序)
- UVA 299 Train Swapping 列车交换 冒泡排序简单模拟
- (排序算法的应用7.3.8)UVA 299 Train Swapping(使用冒泡排序来计算逆序对数)
- UVa 299 Train Swapping
- Uva 299 Train Swapping
- uva 299 Train Swapping
- UVA 299 - Train Swapping
- UVA 299-Train Swapping
- UVa 299 - Train Swapping
- uva-299 - Train Swapping
- UVa 299 - Train Swapping
- UVa 299 - Train Swapping
- UVa 299 - Train Swapping
- 设计模式C++实现(13)——中介者模式
- 设计模式C++实现(14)——职责链模式
- oracle笔记--在线考试综合实例
- 英语秘籍
- Qt Model/View学习笔记之七Delegate类
- UVa 299 Train Swapping (冒泡排序的次数)
- 搜索大戏:上半场还未落幕,下半场才刚开启
- 设计模式C++实现(15)——观察者模式
- 设计模式C++实现(16)——状态模式
- 两道关于C++对象内存模型和多态机制的tricky题目
- python socket编程基本操作
- 华为面试 2014 ---武汉洪广大酒店
- Linux vi操作手册
- 如何在WORD2010中取消自动编号?