博客
关于我
例题8-1 UVA - 120
阅读量:633 次
发布时间:2019-03-14

本文共 1098 字,大约阅读时间需要 3 分钟。

 Stacks of Flapjacks  UVA - 120

/*算法竞赛入门 LRJ 例题8-1 UVA - 120*/#include
#include
#include
#include
#include
#include
#include
#include
#include
typedef long long LL;using namespace std;#pragma comment(linker, "/STACK:102400000,102400000")const double eps = 1e-6;const int INF=0x3f3f3f3f;const int N = 1010;const int PI = acos(-1.0);int a[N],b[N];bool cmp(int x,int y){ return x > y;}void handle(int l,int r){ while(l < r) { int temp = a[l]; a[l] = a[r]; a[r] = temp; l++; r--; }}int main(){ int n = 0; char c; while(~scanf("%d%c",&a[++n],&c)) { while(c == ' ') scanf("%d%c",&a[++n],&c); for(int i = 1 ;i <= n; i++) { // b[i] = a[i]; if(i == n) printf("%d\n",a[i]); else printf("%d ",a[i]); } handle(1,n); for(int i = 1 ;i <= n; i++) b[i] = a[i]; sort(b+1,b+n+1,cmp); for(int i = 1; i <= n; i++) { //printf("%d ",b[i]); if(b[i] == a[i]) continue; int temp; for(int j = i+1; j <= n; j++) if(b[i] == a[j]) temp = j; if(temp != n) { printf("%d ",temp); handle(temp,n); temp = n; } printf("%d ",i); handle(i,temp); } printf("0\n"); n = 0; } return 0;}

转载地址:http://gcaoz.baihongyu.com/

你可能感兴趣的文章
mysql 1264_关于mysql 出现 1264 Out of range value for column 错误的解决办法
查看>>
mysql 1593_Linux高可用(HA)之MySQL主从复制中出现1593错误码的低级错误
查看>>
mysql 5.6 修改端口_mysql5.6.24怎么修改端口号
查看>>
MySQL 8.0 恢复孤立文件每表ibd文件
查看>>
MySQL 8.0开始Group by不再排序
查看>>
mysql ansi nulls_SET ANSI_NULLS ON SET QUOTED_IDENTIFIER ON 什么意思
查看>>
multi swiper bug solution
查看>>
MySQL Binlog 日志监听与 Spring 集成实战
查看>>
MySQL binlog三种模式
查看>>
multi-angle cosine and sines
查看>>
Mysql Can't connect to MySQL server
查看>>
mysql case when 乱码_Mysql CASE WHEN 用法
查看>>
Multicast1
查看>>
MySQL Cluster 7.0.36 发布
查看>>
Multimodal Unsupervised Image-to-Image Translation多通道无监督图像翻译
查看>>
MySQL Cluster与MGR集群实战
查看>>
multipart/form-data与application/octet-stream的区别、application/x-www-form-urlencoded
查看>>
mysql cmake 报错,MySQL云服务器应用及cmake报错解决办法
查看>>
Multiple websites on single instance of IIS
查看>>
mysql CONCAT()函数拼接有NULL
查看>>