hdu 6197 array array array
2018-06-17 21:56:01来源:未知 阅读 ()
array array array
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 459 Accepted Submission(s): 282
Kiddo: "I have an array A and a number k , if you can choose exactly k elements from A and erase them, then the remaining array is in non-increasing order or non-decreasing order, we say A is a magic array. Now I want you to tell me whether A is a magic array. " Conan: "emmmmm..." Now, Conan seems to be in trouble, can you help him?
1≤T≤20
1≤n≤105
0≤k≤n
1≤Ai≤105
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<queue> #include<vector> #include<cmath> #include<string> #define LL long long const int maxn=1e5+5; using namespace std; int a[maxn],b[maxn],c[maxn]; int n; int LIS(int *d){ memset(c,0,sizeof(c)); c[1]=d[1]; int l,r,mid,len=1; for(int i=2;i<=n;i++){ l=1; r=len; while(l<=r){ mid=(l+r)/2; if(c[mid]<=d[i]) l=mid+1; else r=mid-1; } c[l]=d[i]; if(l>len) len++; } return len; } int main() { int T; scanf("%d",&T); int k; while(T--) { scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); b[i]=-a[i]; } int maxn=max(LIS(a),LIS(b)); if(n-maxn>k) printf("A is not a magic array.\n"); else printf("A is a magic array.\n"); } return 0; }
标签:
版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有
- C++ 模板类array 2020-05-31
- HDU-2955-Robberies(0-1背包) 2020-03-30
- hdu1455 拼木棍(经典dfs) 2020-02-29
- anniversary party_hdu1520 2020-02-16
- hdu1062 text reverse 2020-01-27
IDC资讯: 主机资讯 注册资讯 托管资讯 vps资讯 网站建设
网站运营: 建站经验 策划盈利 搜索优化 网站推广 免费资源
网络编程: Asp.Net编程 Asp编程 Php编程 Xml编程 Access Mssql Mysql 其它
服务器技术: Web服务器 Ftp服务器 Mail服务器 Dns服务器 安全防护
软件技巧: 其它软件 Word Excel Powerpoint Ghost Vista QQ空间 QQ FlashGet 迅雷
网页制作: FrontPages Dreamweaver Javascript css photoshop fireworks Flash