飞来山上千寻塔,闻说鸡鸣见日升。

不畏浮云遮望眼,自缘身在最高层。——王安石

题目:Booksort

网址:http://poj.org/problem?id=3460

Description

The Leiden University Library has millions of books. When a student wants to borrow a certain book, he usually submits an online loan form. If the book is available, then the next day the student can go and get it at the loan counter. This is the modern way of borrowing books at the library.

There is one department in the library, full of bookcases, where still the old way of borrowing is in use. Students can simply walk around there, pick out the books they like and, after registration, take them home for at most three weeks.

Quite often, however, it happens that a student takes a book from the shelf, takes a closer look at it, decides that he does not want to read it, and puts it back. Unfortunately, not all students are very careful with this last step. Although each book has a unique identification code, by which the books are sorted in the bookcase, some students put back the books they have considered at the wrong place. They do put it back onto the right shelf. However, not at the right position on the shelf.

Other students use the unique identification code (which they can find in an online catalogue) to find the books they want to borrow. For them, it is important that the books are really sorted on this code. Also for the librarian, it is important that the books are sorted. It makes it much easier to check if perhaps some books are stolen: not borrowed, but yet missing.

Therefore, every week, the librarian makes a round through the department and sorts the books on every shelf. Sorting one shelf is doable, but still quite some work. The librarian has considered several algorithms for it, and decided that the easiest way for him to sort the books on a shelf, is by sorting by transpositions: as long as the books are not sorted,

take out a block of books (a number of books standing next to each other),

shift another block of books from the left or the right of the resulting ‘hole’, into this hole,

and put back the first block of books into the hole left open by the second block.

One such sequence of steps is called a transposition.

The following picture may clarify the steps of the algorithm, where X denotes the first block of books, and Y denotes the second block.

Original situation:

After step 1:

After step 2:

After step 3:

Of course, the librarian wants to minimize the work he has to do. That is, for every bookshelf, he wants to minimize the number of transpositions he must carry out to sort the books. In particular, he wants to know if the books on the shelf can be sorted by at most 4 transpositions. Can you tell him?

Input

The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:

One line with one integer n with 1 ≤ n ≤ 15: the number of books on a certain shelf.

One line with the n integers 1, 2, …, n in some order, separated by single spaces: the unique identification codes of the n books in their current order on the shelf.

Output

For every test case in the input file, the output should contain a single line, containing:

if the minimal number of transpositions to sort the books on their unique identification codes (in increasing order) is T ≤ 4, then this minimal number T;

if at least 5 transpositions are needed to sort the books, then the message "5 or more".

Sample Input
3
6
1 3 4 6 2 5
5
5 4 3 2 1
10
6 8 5 3 4 7 2 9 1 10
Sample Output
2
3
5 or more

首先,理解:选取某一段剪切至另一位置的后面,等价于将该段到该位置的区间到该段前面;

若选区间[L, R)将其剪切至pos的后面(pos >= R),等价于将[R, pos ]剪切至L之前。

故只考虑将一区间剪切至后面的位置即可,避免重复计算相同状态了。

看起来整一棵搜索树的规模是无穷无尽的,因此即便限制深度为5,效率并不高;

可以考虑以下做法:

  • 双向广搜

    不解释;

  • IDA*

    估价函数为错误后继的个数tot除以三;

    若[tot / 3] + now.dep > dep,剪枝;

    不解释。

代码如下:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<vector> using namespace std; int n, p[16];
bool valid(int *s)
{
for(int i = 1; i <= n; ++ i) if(s[i - 1] != i) return false;
return true;
}
void flip(int *s, int cur, int len, int *c, int pos)
{
vector <int> q;
q.clear();
for(int i = 0; i < cur; ++ i) q.push_back(c[i]); for(int i = cur + len; i <= pos; ++ i) q.push_back(c[i]);
for(int i = 0; i < len; ++ i) q.push_back(s[i]);
for(int i = pos + 1; i < n; ++ i) q.push_back(c[i]); for(int i = 0; i < n; ++ i) c[i] = q[i];
return;
}
bool dfs(int *a, int dep)
{
if(valid(a)) return true;
if(dep == 0) return false;
int num = 0;
for(int i = 0; i < n - 1; ++ i) if(a[i + 1] != a[i] + 1) ++ num;
if(num > dep * 3) return false;
int copy[16], s[15];
memcpy(copy, a, sizeof(copy));
for(int len = 1; len < n; ++ len)//限制了长度
{
for(int i = 0; i + len < n; ++ i)//定位
{
for(int k = i; k < i + len; ++ k) s[k - i] = a[k];
for(int j = i + len; j < n; ++ j)
{
flip(s, i, len, copy, j);//复制粘贴函数
if(dfs(copy, dep - 1)) return true;
memcpy(copy, a, sizeof(copy));
}
}
}
return false;
}
int main()
{
int T, copy[16];
int dep;
scanf("%d", &T);
bool ok = false;
while(T --)
{
scanf("%d", &n);
memset(p, 0, sizeof(p));
for(int i = 0; i < n; ++ i) scanf("%d", &p[i]);
for(dep = 0; dep < 5; ++ dep)
{
memcpy(copy, p, sizeof(copy));
if(dfs(copy, dep))
{
printf("%d\n", dep);
ok = true;
break;
}
}
if(ok) ok = false;
else puts("5 or more");
}
return 0;
}

POJ3460 Booksort的更多相关文章

  1. POJ3460 Booksort(IDA*)

    POJ3460 Booksort 题意:给定一个长度为n的序列,每次可以取出其中的一段数,插入任意一个位置,问最少需要几次操作才能使整个序列变为1~n 思路:IDA*+迭代加深搜索 小技巧:将一段数插 ...

  2. A*专题训练

    POJ2449 Remmarguts' Date UDF's capital consists of N stations. The hall is numbered S, while the sta ...

  3. hdu 1685 Booksort (IDA*)

    Booksort Time Limit: 10000/10000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others) Tot ...

  4. POJ 3460 Booksort(算竞进阶习题)

    IDA* 这题真不会写..估价函数太巧妙了.. 按照lyd神牛的说法我们把a[i+1]=a[i]+1记为正确后继,反之则记为错误后继 那么考虑最优的一次交换区间,至多能够纠正三个错误后继,所以我们统计 ...

  5. Booksort POJ - 3460 (IDA*)

    Description The Leiden University Library has millions of books. When a student wants to borrow a ce ...

  6. 【POJ 3460】 Booksort

    [题目链接] http://poj.org/problem?id=3460 [算法] IDA* 注意特判答案为0的情况 [代码] #include <algorithm> #include ...

  7. acm位运算应用 搜索

    acm位运算应用 搜索 搜索    此处不讲题目,只讲位运算是怎样在这些题中实现和应用的.由于搜索题往往是基于对状态的操作,位运算往往特别有效,优化之后的效果可以有目共睹.    例1.POJ 132 ...

  8. Server Tomcat v7.0 Server at localhost failed to start.

    1:这里记录一下这个错误,反正百度一大推,但是很长很长,我感觉这个问题肯定是servlet引起的,因为我遇到的总是如此: 2:我的问题如下所示: <servlet> <servlet ...

  9. scrapy爬去京东书籍信息

    # -*- coding: utf-8 -*- import scrapy import urllib import json from copy import deepcopy class JdSp ...

随机推荐

  1. C/C++知识总结 二 C/C++基础知识

    C/C++基础知识 C/C++基本格式说明 C/C++基本常识说明 C/C++基本格式说明 C语言基本格式 #include<stdio.h> //预处理文件 int main() //自 ...

  2. ThinkPHP6.0学习笔记-模型操作

    ThinkPHP模型 模型定义 在app目录下创建Model目录,即可创建模型文件 定义一个和数据库表相匹配的模型 use think\Model; class User extends Model ...

  3. Shell:Day09.笔记

    awk [单独的编程语言解释器]1.awk介绍 全称:Aho Weinberger Kernaighan 三个人的首字母缩写:  1970年第一次出现在Unix机器上,后来在开源领域使用它: 所以,我 ...

  4. Vulnhub FristiLeaks靶机渗透

    VM上配置 VMware users will need to manually edit the VM's MAC address to: 08:00:27:A5:A6:76 VM上选择本靶机,编辑 ...

  5. C语言学生管理系统完善版

    #include<stdio.h>#include<string.h>#include <stdlib.h>#define M 100struct score    ...

  6. C# 发布时出现:在与 SQL Server 建立连接时出现与网络相关的或特定于实例的错误

    在与 SQL Server 建立连接时出现与网络相关的或特定于实例的错误.未找到或无法访问服务器.请验证实例名称是否正确并且 SQL Server 已配置为允许远程连接. (provider: SQL ...

  7. php.ini配置文件详解(基于5.2.17版本)

    [PHP] ;;;;;;;;;;;;;;;;;;;; About php.ini ;;;;;;;;;;;;;;;;;;;; ;;;;;;;;;;;;;;;;;;;; 关于php.ini文件 ;;;;; ...

  8. 2019-07-31【机器学习】无监督学习之降维PCA算法实例 (鸢尾花)

    样本 代码: import matplotlib.pyplot as plt from sklearn.decomposition import PCA from sklearn.datasets i ...

  9. 如何正确管理HBase的连接,从原理到实战

    本文将介绍HBase的客户端连接实现,并说明如何正确管理HBase的连接. 最近在搭建一个HBase的可视化管理平台,搭建完成后发现不管什么查询都很慢,甚至于使用api去listTable都要好几秒. ...

  10. Linux/UNIX 下 “command not found” 原因分析及解决

    在使用 Linux/UNIX 时,会经常遇到 "command not found" 的错误,就如提示的信息,Linux /UNIX 没有找到该命令.原因无外乎你命令拼写错误或 L ...