A. Little Elephant and Problem
2014-06-11 14:17
393 查看
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
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.
Sample test(s)
input
output
input
output
input
output
Note
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".
解题说明:此题是判断通过一次交换让一列数变成从小到大有序的数列,最简单的做法是比较排序前后的数列,看改变位置的数字有多少,如果为0或者2就满足题意。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include <algorithm>
#include<cstring>
#include<string>
using namespace std;
int main()
{
int n,a[100009],b[100009];
int i,sum;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(b, b + n);
sum = 0;
for (i = 0; i < n; i++)
{
if (a[i] != b[i])
{
sum++;
}
}
if (sum <= 2)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
return 0;
}
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
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.
Sample test(s)
input
2 1 2
output
YES
input
3 3 2 1
output
YES
input
4 4 3 2 1
output
NO
Note
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".
解题说明:此题是判断通过一次交换让一列数变成从小到大有序的数列,最简单的做法是比较排序前后的数列,看改变位置的数字有多少,如果为0或者2就满足题意。
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include <algorithm>
#include<cstring>
#include<string>
using namespace std;
int main()
{
int n,a[100009],b[100009];
int i,sum;
scanf("%d", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(b, b + n);
sum = 0;
for (i = 0; i < n; i++)
{
if (a[i] != b[i])
{
sum++;
}
}
if (sum <= 2)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
return 0;
}
相关文章推荐
- D - Little Elephant and Problem
- Little Elephant and Problem
- AC日记——Little Elephant and Problem codeforces 221c
- Codeforces 221 C. Little Elephant and Problem
- CodeForces 220A Little Elephant and Problem
- B. Little Elephant and Sorting
- SRM 597 D2 L2:LittleElephantAndString
- codechef Little Elephant and Permutations题解
- 【Codeforces Round 169 (Div 2) E】【数据结构区间维护】Little Girl and Problem on Trees 大菊花树的距离性修改查询
- Codeforces Round #129 (Div. 1) A Little Elephant and Interval
- *[topcoder]LittleElephantAndBalls
- A. Little Elephant and Bits
- CodeForces 220B(B. Little Elephant and Array)
- CodeChef Little Elephant and Balance
- codeblocks B - Little Elephant and Numbers
- CodeForces - 205B - Little Elephant and Sorting
- CodeForces 276E Little Girl and Problem on Trees 树状数组
- CodeForces Round #136(220B) - Little Elephant and Array
- Little Elephant and Function
- Little Elephant and Array 线段树