acdream 1146 Moist
2015-07-07 13:42
169 查看
Problem Description
Moist has a hobby -- collecting figure skating trading cards. His card collection has been growing, and it is now too large to keep in one disorganized pile. Moist needs to sort the cards in alphabetical order, sothat he can find the cards that he wants on short notice whenever it is necessary.
The problem is -- Moist can't actually pick up the cards because they keep sliding out his hands, and the sweat causes permanent damage. Some of the cards are rather expensive, mind you. To facilitate the sorting,
Moist has convinced Dr. Horrible to build him a sorting robot. However, in his rather horrible style, Dr. Horrible has decided to make the sorting robot charge Moist a fee of $1 whenever it has to move a trading card during the sorting process.
Moist has figured out that the robot's sorting mechanism is very primitive. It scans the deck of cards from top to bottom. Whenever it finds a card that is lexicographically smaller than the previous
card, it moves that card to its correct place in the stack above. This operation costs $1, and the robot resumes scanning down towards the bottom of the deck, moving cards one by one until the entire deck is
sorted in lexicographical order from top to bottom.
As wet luck would have it, Moist is almost broke, but keeping his trading cards in order is the only remaining joy in his miserable life. He needs to know how much it would cost him to use the robot to sort his deck
of cards.
Input
The first line of the input gives the number of test cases, T(1 ≤ T ≤ 100).T test cases follow.
Each one starts with a line containing a single integer, N(1 ≤ N ≤ 100).
The next N lines each contain the name of a figure skater, in order from the top of the deck to the bottom.
Each name will consist of only letters and the space character.
Each name will contain at most 100 characters.
No name with start or end with a space.
No name will appear more than once in the same test case.
Output
For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the number of dollars it would cost Moist to use the robot to sort his deck of trading cards.
Sample Input
3 2 Oksana Baiul Michelle Kwan 3 Elvis Stojko Evgeni Plushenko Kristi Yamaguchi 4 Evgeni Plushenko Kristi Yamaguchi Elvis Stojko Aksana Baiul
Sample Output
Case #1: 1 Case #2: 0 Case #3: 2
类似插入排序,统计插入的次数。
/*
* this code is made by yuexunjiang
* Problem: 1146
* Verdict: Accepted
* Submission Date: 2015-07-07 13:37:24
* Time: 4MS
* Memory: 1692KB
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;
const int MAXN = 100 + 5;
char ch[MAXN][MAXN];
vector<char*> v;
int main(){
#if 0
freopen("A.in","rt",stdin);
#endif
int t,n,num = 1;
cin >>t;
while(t--){
cin >>n;
getchar();
v.clear();
for(int i = 0;i < n;i++){
fgets(ch[i],MAXN,stdin);
v.push_back(ch[i]);
}
int cnt = 0;
for(vector<char *>::iterator it=v.begin()+1; it!=v.end(); ++it){
if(strcmp(*it, *(it-1)) < 0){
v.erase(it);
--it;
cnt++;
}
}
cout <<"Case #" <<num++ <<": "<<cnt <<endl;
}
return 0;
}
相关文章推荐
- C语言之基本算法19—枚举勾股数
- 多线程1
- UVa 11549 Open Credit System
- 【代码备忘录】VC设置您的计算机环境变量、注册表操作
- Netty简单介绍和例子
- PHP常用正则表达式汇总(转)
- Django运行方式及处理流程总结
- SpringMVC(四)@RequestParam
- DWR框架实例解析
- 《Java程序》使用递归调用的方法,写一个能够将字符串倒叙输出的函数
- MySQL详解----------海量数据分页查询优化
- 左侧固定 右侧自适应 布局
- Nginx+Tomcat负载均衡之session问题
- triangle
- 两个DIV第一个用了定位后 如何让两个DIV 落在一起
- 数据库设计备注
- Fiddler 教程
- java 反射
- SSH使用密钥登录并禁止口令登录实践
- 关于java图像处理的一些文章