算法day07
来源:互联网 发布:阿里云cdn签名 编辑:程序博客网 时间:2024/06/02 05:48
1.UVA 10327 Flip Sort
Sorting in computer science is an important part. Almost every problem can be solved effeciently if sorted data are found. There are some excellent sorting algorithm which has already acheived the lower bound nlgn. In this problem we will also discuss about a new sorting approach. In this approach only one operation ( Flip ) is available and that is you can exchange two adjacent terms. If you think a while, you will see that it is always possible to sort a set of numbers in this way.
The Problem
A set of integers will be given. Now using the above approach we want to sort the numbers in ascending order. You have to find out the minimum number of flips required. Such as to sort “1 2 3” we need no flip operation whether to sort “2 3 1” we need at least 2 flip operations.
The Input
The input will start with a positive integer N ( N<=1000 ). In next few lines there will be N integers. Input will be terminated by EOF.
The Output
For each data set print “Minimum exchange operations : M” where M is the minimum flip operations required to perform sorting. Use a seperate line for each case.
Sample Input
3
1 2 3
3
2 3 1
Sample Output
Minimum exchange operations : 0
Minimum exchange operations : 2
代码:
#include <stdio.h>#include <iostream>using namespace std;int main(){ int a[100],n,flag,ans,i; ans=0; cin>>n; while(!cin.eof()) //输入以EOF结束 { flag=0; for(i=1;i<=n;i++) cin>>a[i]; for(i=1;i<n;i++) if(a[i]>a[i+1]) { swap(a[i],a[i+1]); ans++; } cout<<"MInimum exchange operations :"<<ans<<endl; cin>>n; } return 0;}
Tips:
1.输入以EOF(end of file)结束,
win首先在最后一行结束后输入ENTER键,再输入ctrl+z,再输入时ENTER键即可。
Linux首先在最后一行结束后输入ENTER键,再输入ctrl+d,再输入时ENTER键即可。
2.
a.getchar
c = getchar();//读入一个字符。 if(c == EOF)break;//如果遇到EOF则退出循环,即结束输入。
b.scanf
ret = scanf("%d",&c);//读入一个整型值。 if(ret == EOF)break;//如果遇到EOF则退出循环,即结束输入。注意判断的是返回值,而不是读入的变量。
c.gets
if(gets(s) == NULL) break;// 当gets返回NULL时代表遇到EOF,结束输入。
d.cin
while(!cin.eof()) //输入以EOF结束
- 算法day07
- day07
- day07
- day07
- day07
- day07
- day07
- day07
- day07
- day07
- day07
- day07
- Day07
- day07
- day07
- day07
- day07-tomcat
- day07 homework
- linux常见压缩解压命令
- Hive常见问题及处理方法
- 项目实战之集成邮件开发
- ini_set("display_errors","On");和error_reporting(E_ALL);
- c#中堆和栈的区别
- 算法day07
- 定时器的使用
- 菜鸟springboot学习之旅之@RequestBody
- LCA算法模板(离线算法,在线算法)
- 键盘事件
- 公众号涨粉的3大技巧
- 策略模式
- 新浪微博分享出现libc++abi.dylib: terminating with uncaught exception of type NSException微博微信SDK运行编译报错
- 玩手游,别傻傻原价充值!!!