HDOJ 5500 Reorder the Books(贪心)
来源:互联网 发布:r数据可视化手册 网盘 编辑:程序博客网 时间:2024/05/24 15:43
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 726 Accepted Submission(s): 417
Problem Description
dxy has a collection of a series of books called "The Stories of SDOI",There aren(n≤19) books in this series.Every book has a number from 1 to n .
dxy puts these books in a book stack with the order of their numbers increasing from top to bottom. dxy takes great care of these books and no one is allowed to touch them.
One day Evensgn visited dxy's home, because dxy was dating with his girlfriend, dxy let Evensgn stay at home himself. Evensgn was curious about this series of books.So he took a look at them. He found out there was a story about "Little E&Little Q". While losing himself in the story,he disrupted the order of the books.
Knowing that dxy would be back soon,Evensgn needed to get the books ordered again.But because the books were too heavy.The only thing Evensgn could do was to take out a book from the book stack and and put it at the stack top.
Give you the order of the disordered books.Could you calculate the minimum steps Evensgn would use to reorder the books? If you could solve the problem for him,he will give you a signed book "The Stories of SDOI 9: The Story of Little E" as a gift.
dxy puts these books in a book stack with the order of their numbers increasing from top to bottom. dxy takes great care of these books and no one is allowed to touch them.
One day Evensgn visited dxy's home, because dxy was dating with his girlfriend, dxy let Evensgn stay at home himself. Evensgn was curious about this series of books.So he took a look at them. He found out there was a story about "Little E&Little Q". While losing himself in the story,he disrupted the order of the books.
Knowing that dxy would be back soon,Evensgn needed to get the books ordered again.But because the books were too heavy.The only thing Evensgn could do was to take out a book from the book stack and and put it at the stack top.
Give you the order of the disordered books.Could you calculate the minimum steps Evensgn would use to reorder the books? If you could solve the problem for him,he will give you a signed book "The Stories of SDOI 9: The Story of Little E" as a gift.
Input
There are several testcases.
There is an positive integerT(T≤30) in the first line standing for the number of testcases.
For each testcase, there is an positive integern in the first line standing for the number of books in this series.
Followedn positive integers separated by space standing for the order of the disordered books,theith integer stands for the ith book's number(from top to bottom).
Hint:
For the first testcase:Moving in the order ofbook3,book2,book1 ,(4,1,2,3)→(3,4,1,2)→(2,3,4,1)→(1,2,3,4) ,and this is the best way to reorder the books.
For the second testcase:It's already ordered so there is no operation needed.
There is an positive integer
For each testcase, there is an positive integer
Followed
Hint:
For the first testcase:Moving in the order of
For the second testcase:It's already ordered so there is no operation needed.
Output
For each testcase,output one line for an integer standing for the minimum steps Evensgn would use to reorder the books.
Sample Input
244 1 2 351 2 3 4 5
Sample Output
30大意:每次可以从第一位后面选一个数放到第一位,问操作几次之后能将数变为顺序数思路:刚开始直接看了样例,理解错了题,最后一看题才知道不是那样,晕,先找最大的那个数,找到后自减然后找下一个,如果第一位就是最大的,那么共需要n步,即按顺序从后面挑选n次数。ac代码:#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#define MAXN 201000#define MAX(a,b) a>b?a:b#define fab(a) a>0?a:-ausing namespace std;int a[MAXN];int main(){int t,i,j,n,num;scanf("%d",&t);while(t--){scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&a[i]);int num=n;for(int k=n-1;k>=0;){if(a[k]==num)num--;k--;}printf("%d\n",num);}return 0;}
0 0
- HDOJ 5500 Reorder the Books(贪心)
- HDOJ 5500 Reorder the Books(贪心)
- HDOJ--5500--Reorder the Books
- hdoj 5500 Reorder the Books
- HDOJ 5500-Reorder the Books
- hdoj 5500 Reorder the Books 【好题】
- HDOJ-5500Reorder the Books(规律)
- hdoj 5500 Reorder the Books 【规律】
- hdoj 5500Reorder the Books【规律】
- hdoj 5500 Reorder the Books 【规律题】
- hdoj--5500--Reorder the Books(技巧)
- HDOJ 5500 Reorder the Books(规律)
- hdoj 5500 Reorder the Books 【基础】
- hdu 5500 Reorder the Books(贪心)
- hdu 5500 Reorder the Books【贪心】【思维】
- Reorder the Books hdu 5500 贪心
- hdu5500 Reorder the Books 贪心
- hdoj Reorder the Books 5500 (技巧) 好题
- cmd取UTF-8编码的数据显示乱码
- 我所认识的BIM&Revit
- iOS开发网络篇—HTTP协议
- PuTTY使用
- POJ1274 二分匹配
- HDOJ 5500 Reorder the Books(贪心)
- mingw1.0下vs2010编译ffmpeg2.3,支持jpeg/png/libx264,mp3/aac/jpeg/ping/x264解码
- Python函数参数传值问题
- Android中四大组件
- sublime text 3 python 开发环境搭建
- OC第四天:NSString、NSArray、NSNumber
- 软件生命周期及模型
- zebra安装及配置
- iOS@selector带参数的用法