Little Elephant and Problem
来源:互联网 发布:淘宝买家怎么申请退款 编辑:程序博客网 时间:2024/04/29 04:37
题目链接: http://codeforces.com/contest/221/problem/C
The Little Elephant has got a problem — somebody has been touching his sorted by non-decreasing array a of length n and possibly swapped some elements of the array.
The Little Elephant doesn't want to call the police until he understands if he could have accidentally changed the array himself. He thinks that he could have accidentally changed array a, only if array a can be sorted in no more than one operation of swapping elements (not necessarily adjacent). That is, the Little Elephant could have accidentally swapped some two elements.
Help the Little Elephant, determine if he could have accidentally changed the array a, sorted by non-decreasing, himself.
The first line contains a single integer n (2 ≤ n ≤ 105) — the size of array a. The next line contains n positive integers, separated by single spaces and not exceeding 109, — array a.
Note that the elements of the array are not necessarily distinct numbers.
In a single line print "YES" (without the quotes) if the Little Elephant could have accidentally changed the array himself, and "NO" (without the quotes) otherwise.
21 2
YES
33 2 1
YES
44 3 2 1
NO
In the first sample the array has already been sorted, so to sort it, we need 0 swap operations, that is not more than 1. Thus, the answer is "YES".
In the second sample we can sort the array if we swap elements 1 and 3, so we need 1 swap operation to sort the array. Thus, the answer is "YES".
In the third sample we can't sort the array in more than one swap operation, so the answer is "NO".
题目大意是这样:给你一个数组,数组里有N个不同整数(2≤n≤105) ,如果所给数组里N个不同整数已经是递增次序,或者互换其中两个数一次能使数组按递增次序排列,那么输出“YES”; 否则输出“NO”
代码:
#include <iostream>#include <stdio.h>#include <algorithm>using namespace std;int x;int d;int b[100005],a[100005];int main(){int n;cin>>n;int i,j;for(i=1;i<=n;i++){scanf("%d",&a[i]);b[i]=a[i];}int c=0,flag1=0,flag2=0;if(n==2){cout<<"YES"<<endl;return 0;}sort(b+1,b+n+1);for(i=1;i<=n;i++){if(a[i]!=b[i]){ c++;if(flag1==0)flag1=i;else flag2=i;}}if(c==0){cout<<"YES"<<endl;return 0;}if(c==2){int flag=1;swap(a[flag1],a[flag2]);for(i=1;i<=n;i++){if(a[i]!=b[i]){flag=0;cout<<"NO"<<endl;return 0;}}if(flag==1){cout<<"YES"<<endl;return 0;}}cout<<"NO"<<endl;return 0;}
- Little Elephant and Problem
- A. Little Elephant and Problem
- CodeForces 220A Little Elephant and Problem
- codeforces 221C Little Elephant and Problem
- Codeforces Round #136 (Div. 2) C. Little Elephant and Problem
- Little Elephant and Function
- Little Elephant and Mouses
- Little Elephant and Interval
- <codeforces>Little Elephant and Sorting
- A. Little Elephant and Function
- A. Little Elephant and Chess
- A. Little Elephant and Rozdil
- B. Little Elephant and Numbers
- Little Elephant and Inversions CF220E
- A. Little Elephant and Bits
- B. Little Elephant and Sorting
- A. Little Elephant and Bits
- CF Little Elephant and Shifts
- HDU 1065 || ZOJ 1049 I Think I Need a Houseboat
- 材质纹理
- Little Elephant and Function
- Android学习笔记进阶十一图片动画播放(AnimationDrawable)
- EGL intro 概述
- Little Elephant and Problem
- OpenGL ES 概述
- 编程必备*错误异常信息记录工具—log4j使用方法
- IDIOPEN 2011 G - Sleeping at Work
- C++面试题:介绍一下STL,STL如何实现vector
- linux动静态库的创建及使用
- Android动画背景图自动播放的实现
- 快速搭建SVN服务器
- The New Ycnd易语言专版终于完成!引擎新版本将于近期正式发布!