HDU 4749 Parade Show(暴力水果)
来源:互联网 发布:域名紧急升级正在跳转 编辑:程序博客网 时间:2024/05/16 23:36
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4749
Problem Description
2013 is the 60 anniversary of Nanjing University of Science and Technology, and today happens to be the anniversary date. On this happy festival, school authority hopes that the new students to be trained for the parade show. You should plan a better solution to arrange the students by choosing some queues from them preparing the parade show. (one student only in one queue or not be chosen)
Every student has its own number, from 1 to n. (1<=n<=10^5), and they are standing from 1 to n in the increasing order the same with their number order. According to requirement of school authority, every queue is consisted of exactly m students. Because students who stand adjacent in training are assigned consecutive number, for better arrangement, you will choose in students with in consecutive numbers. When you choose these m students, you will rearrange their numbers from 1 to m, in the same order with their initial one.
If we divide our students’ heights into k (1<=k<=25) level, experience says that there will exist an best viewing module, represented by an array a[]. a[i] (1<=i<=m)stands for the student’s height with number i. In fact, inside a queue, for every number pair i, j (1<=i,j<=m), if the relative bigger or smaller or equal to relationship between the height of student number i and the height of student number j is the same with that between a[i] and a[j], then the queue is well designed. Given n students’ height array x[] (1<=x[i]<=k), and the best viewing module array a[], how many well designed queues can we make at most?
Input
Multiple cases, end with EOF.
First line, 3 integers, n (1<=n<=10^5) m (1<=m<=n) k(1<=k<=25),
Second line, n students’ height array x[] (1<=x[i]<=k,1<=i<=n);
Third line, m integers, best viewing module array a[] (1<=a[i]<=k,1<=i<=m);
First line, 3 integers, n (1<=n<=10^5) m (1<=m<=n) k(1<=k<=25),
Second line, n students’ height array x[] (1<=x[i]<=k,1<=i<=n);
Third line, m integers, best viewing module array a[] (1<=a[i]<=k,1<=i<=m);
Output
One integer, the maximal amount of well designed queues.
Sample Input
10 5 102 4 2 4 2 4 2 4 2 41 2 1 2 1
Sample Output
1
Source
2013 ACM/ICPC Asia Regional Nanjing Online
题意:
给出了一列数,再给出了一列参照的数列其每个数代表一个高度且须满足大小关系,求可以将所给的数列分割成多少个满足参照数列个数和高度的数列!
PS:
数据太水了,暴力过了! 正解貌似是KMP, 算了日后再补正解吧!
代码如下:
#include <cstdio>#include <cstring>#include <algorithm>#include <iostream>using namespace std;const int maxn = 100017;int a[maxn], b[maxn];int main(){ int n, m, k; while(~scanf("%d%d%d",&n,&m,&k)) { for(int i = 0; i < n; i++) { scanf("%d",&a[i]); } for(int i = 0; i < m; i++) { scanf("%d",&b[i]); } int cont = 0; for(int i = 0; i <= n-m; i++) { int tt = 0; for(int j = 0,l = i; l < m+i-1; l++,j++) { if((a[l]==a[l+1]&&b[j]==b[j+1]) || (a[l]>a[l+1]&&b[j]>b[j+1]) || (a[l]<a[l+1]&&b[j]<b[j+1])) { tt++; } else break; } if(tt == m-1) { cont++; i+=m-1; } } printf("%d\n",cont); } return 0;}
1 0
- HDU 4749 Parade Show(暴力水果)
- Hdu-4749 Parade Show
- hdu 4749 Parade Show (暴力水 (正解应该是kmp变形))
- HDU 4749 Parade Show(KMP)
- HDU 4749 Parade Show(KMP变形)
- hdu 4749 Parade Show ( kmp )
- hdu 4749 Parade Show KMP
- hdu 4749 Parade Show(KMP)
- HDU 4749 Parade Show Kmp
- hdu-4749:Parade Show(kmp模板题)
- HDU 4749 Parade Show 数据结构KMP变形
- Hdu 3687 National Day Parade(暴力)
- HDU 3687 National Day Parade(暴力)
- HDOJ 题目 4749 Parade Show(KMP)
- HDU 4749 Parade Show 相对匹配的KMP
- Poj 3167 Cow Patterns Hdu 4749 Parade Show (KMP大小关系相同匹配+树状数组)
- 军训选队伍 相对顺序匹配 kmp hdu 4749 Parade Show
- HDOJ 4749 - Parade Show 思维...贪心...
- java反射和内省
- 阿语和波斯语下Actionbar不从右往左设计
- hdu1496(hash)
- Javascript对象---对象名只是某个对象的引用,并不是副本
- C和指针 二
- HDU 4749 Parade Show(暴力水果)
- HDU 4572Bottles Arrangement 找规律
- Android手机扫描同一网段下的电视盒子的方法
- 二叉树最大宽度和高度(java)
- Openwrt:Makefile框架分析
- java-GUI小练习
- 利用jvmstat进行jvm性能监视
- DM8168 屏蔽 PCIe
- linux中的container of