uva 299 Train Swapping(模拟冒泡排序)
来源:互联网 发布:谁也知夜夜与她那内情 编辑:程序博客网 时间:2024/05/17 06:26
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
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
For each test case output the sentence: 'Optimal train swapping takes S swaps.' where S is an integer.
Sample Input
331 3 244 3 2 122 1
解题思路:模拟按加个计数器。
#include<stdio.h>#include<string.h>#define N 55int num[N];int main(){int t, n, cnt, k;scanf("%d", &t);while (t--){// Init.memset(num, 0, sizeof(num));cnt = 0;// Read.scanf("%d", &n);for (int i = 0; i < n; i++)scanf("%d", &num[i]);// Count.for (int i = 1; i < n; i++){for (int j = 0; j < n - i; j++)if (num[j] > num[j + 1]){k = num[j];num[j] = num[j + 1];num[j + 1] = k;cnt++;}}printf("Optimal train swapping takes %d swaps.\n", cnt);}return 0;}
- 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 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
- UVA 299 Train Swapping
- jquery文件上传插件uploadify在.NET中session丢失的解决方案
- 美丽数
- poj 1664 放苹果
- 泛型-通配符
- JDBC的相关总结,如何链接数据库
- uva 299 Train Swapping(模拟冒泡排序)
- JavaSE Class 类详解
- 如何在 Ubuntu 12.10 或 Ubuntu 13.04 下重置Compiz及Unity
- 面向服务的体系结构(SOA)——(3)关于BPM
- hdu 3336
- 新浪微博客户端开发开篇
- POJ 2400 Supervisor, Supervisee
- OSWorkFlow深入浅出(2)---配置
- 小白6.4.2