zoukankan      html  css  js  c++  java
  • 299 Train Swapping

    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 ( tex2html_wrap_inline30 ). 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

     

    3
    3
    1 3 2
    4
    4 3 2 1
    2
    2 1

     

    Example Output

     

    Optimal train swapping takes 1 swaps.
    Optimal train swapping takes 6 swaps.
    Optimal train swapping takes 1 swaps.

    题意:模拟冒泡排序,最后记录移动的次数。
     1 #include <stdio.h>
     2 #include <string.h>
     3 
     4 int main()
     5 {
     6 int a[100];
     7 int i, j, k, ans, N, L;
     8 scanf("%d", &N);
     9 for(i = 0; i < N; i++)
    10 {
    11 memset(a, 0, sizeof(a));
    12 scanf("%d", &L);
    13 for(j = 0; j < L; j++ )
    14 scanf("%d", &a[j]);
    15 ans = 0;
    16 for(j = L - 1; j >= 0; j--)
    17 for(k = 0; k < j; k++)
    18 if(a[k] > a[k + 1])
    19 {
    20 int t;
    21 t = a[k];
    22 a[k] = a[k + 1];
    23 a[k + 1] = t;
    24 ans++;
    25 }
    26 printf("Optimal train swapping takes %d swaps.\n", ans);
    27 
    28 }
    29 return 0;
    30 }
  • 相关阅读:
    div在父集高度未知的情况下垂直居中的方法
    固比固布局 圣杯布局 css实现传统手机app布局
    img标签的onerror事件
    vue中的swiper element ui
    前后端分离跨域 关于前后端分离开发环境下的跨域访问问题(angular proxy=>nginx )
    自己开发的网页在跳转至微信公众号文章后,点击微信的返回,无法返回原网页
    关于audio元素在实际项目中遇到的问题总结
    移动端HTML5<video>视频播放优化实践
    数据类型转换
    穿越宇宙的邀请函——镜像图片技巧
  • 原文地址:https://www.cnblogs.com/fjutacm/p/2924163.html
Copyright © 2011-2022 走看看