codeforces 814A An abandoned sentiment from past
来源:互联网 发布:淘宝店铺模板代码 编辑:程序博客网 时间:2024/05/20 23:56
A few years ago, Hitagi encountered a giant crab, who stole the whole of her body weight. Ever since, she tried to avoid contact with others, for fear that this secret might be noticed.
To get rid of the oddity and recover her weight, a special integer sequence is needed. Hitagi's sequence has been broken for a long time, but now Kaiki provides an opportunity.
Hitagi's sequence a has a length of n. Lost elements in it are denoted by zeros. Kaiki provides another sequence b, whose length kequals the number of lost elements in a (i.e. the number of zeros). Hitagi is to replace each zero in a with an element from b so that each element in b should be used exactly once. Hitagi knows, however, that, apart from 0, no integer occurs in a and b more than once in total.
If the resulting sequence is not an increasing sequence, then it has the power to recover Hitagi from the oddity. You are to determine whether this is possible, or Kaiki's sequence is just another fake. In other words, you should detect whether it is possible to replace each zero in a with an integer from b so that each integer from b is used exactly once, and the resulting sequence is not increasing.
The first line of input contains two space-separated positive integers n (2 ≤ n ≤ 100) and k (1 ≤ k ≤ n) — the lengths of sequence aand b respectively.
The second line contains n space-separated integers a1, a2, ..., an (0 ≤ ai ≤ 200) — Hitagi's broken sequence with exactly k zero elements.
The third line contains k space-separated integers b1, b2, ..., bk (1 ≤ bi ≤ 200) — the elements to fill into Hitagi's sequence.
Input guarantees that apart from 0, no integer occurs in a and b more than once in total.
Output "Yes" if it's possible to replace zeros in a with elements in b and make the resulting sequence not increasing, and "No" otherwise.
4 211 0 0 145 4
Yes
6 12 3 0 8 9 105
No
4 18 94 0 489
Yes
7 70 0 0 0 0 0 01 2 3 4 5 6 7
Yes
In the first sample:
- Sequence a is 11, 0, 0, 14.
- Two of the elements are lost, and the candidates in b are 5 and 4.
- There are two possible resulting sequences: 11, 5, 4, 14 and 11, 4, 5, 14, both of which fulfill the requirements. Thus the answer is "Yes".
In the second sample, the only possible resulting sequence is 2, 3, 5, 8, 9, 10, which is an increasing sequence and therefore invalid.
贪心~
我们把b数组排序,然后顺次插入到a数组中,判断前后的大小关系即可。
要注意的是a数组也要判断,我在这里卡了三次!
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int n,a[101],b[101],k,tot;bool flag;bool cmp(int u,int v){return u>v;}int main(){scanf("%d%d",&n,&k);for(int i=1;i<=n;i++) scanf("%d",&a[i]);for(int j=1;j<=k;j++) scanf("%d",&b[j]);sort(b+1,b+k+1,cmp);for(int i=1;i<=n;i++){ if(!a[i]) a[i]=b[++tot]; if(a[i]<a[i-1]) flag=1;}if(flag) puts("Yes");else puts("No");}
- Codeforces 814 A An abandoned sentiment from past
- codeforces 814A An abandoned sentiment from past
- Codeforces 814A-An abandoned sentiment from past
- codeforces 814 A An abandoned sentiment from past
- CodeForces 814A An abandoned sentiment from past
- An abandoned sentiment from past 814A
- 814/ A. An abandoned sentiment from past
- Codeforces Round #418 A--An abandoned sentiment from past
- A. An abandoned sentiment from past
- CodeFroces 814A An abandoned sentiment from past(快排)
- An abandoned sentiment from past
- An abandoned sentiment from past
- An abandoned sentiment from past
- An abandoned sentiment from past
- Codeforces Round #418 (Div. 2) problem A. An abandoned sentiment from past
- Codeforces Round #418 (Div. 2)-A. An abandoned sentiment from past-思维
- coderforces--418div2--A.An abandoned sentiment from past
- An abandoned sentiment from past Java 无脑暴力
- 机器学习常用算法解析和入门
- 定时器和BOM对象和Date类
- Web集群搭建(2)-mysql双主配置
- memory latency
- HTML元素设置鼠标事件
- codeforces 814A An abandoned sentiment from past
- Android studio 初步使用JNI(三)简单使用JNI
- wamp升级php7
- 欢迎使用CSDN-markdown编辑器
- 简单谈谈使用SSH的优点、意义
- Editor_ContextMenu,ContextMenuItem学习03
- Codeforces Round #418 (Div. 2) C. An impassioned circulation of affection
- 练手用的
- Thinking in Java 读书笔记 (二)