UVa 299 - Train Swapping
来源:互联网 发布:python 量化教程 编辑:程序博客网 时间:2024/05/16 12:06
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 integerL, determining the length of the train ( ). The second line of a test case contains a permutation of the numbers 1 throughL, indicating the current order of the carriages. The carriages should be ordered such that carriage 1 comes first, then 2, etc. with carriageL 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.
#include <stdio.h>#include <math.h>#include <string.h>int main(){ int n,t,s[55]; scanf("%d",&n); for(int i=1;i<=n;i++) { int num=0; scanf("%d",&t); for(int j=0;j<t;j++) scanf("%d",&s[j]); for(int j=0;j<t-1;j++) for(int k=0;k<t-j-1;k++) if(s[k]>s[k+1]) { int temp=s[k]; s[k]=s[k+1]; s[k+1]=temp; num++; } printf("Optimal train swapping takes %d swaps.\n",num); } 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-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
- UVA - 299 - Train Swapping
- 初识p-code (pcode)
- 我的2012:暴雨和企业政治
- 总结:使用IoMarkPending的原因及原理
- 关于zend framework
- Hdu2159 Fate
- UVa 299 - Train Swapping
- OCJP(1Z0-851) 模拟题分析(三)
- 漫谈兼容内核之十二: Windows的APC机制(毛德操)
- UVa 152 - Tree's a Crowd
- 绘制贝塞尔样条曲线
- UVa 644 - Immediate Decodability
- UIApplicationMain、UIApplication 和 UIApplicationDelegate 协议的关系
- poj - 2528 - Mayor's posters(线段树(区间更新))
- Groovy安装与入门实例