数列有序!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54474 Accepted Submission(s): 23579
Problem Description
有n(n<=100)个整数,已经按照从小到大顺序排列好,现在另外给一个整数x,请将该数插入到序列中,并使新的序列仍然有序。
Input
输入数据包含多个测试实例,每组数据由两行组成,第一行是n和m,第二行是已经有序的n个数的数列。n和m同时为0标示输入数据的结束,本行不做处理。
Output
对于每个测试实例,输出插入新的元素后的数列。
Sample Input
3 3 1 2 4 0 0
Sample Output
1 2 3 4
Author
lcy
程序虽然有点长,但是想的还是挺全面的,一次性AC,哈哈~
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n,m,i;
while (scanf("%d%d",&n,&m) && (n!=0 || m!=0)){
int a[105],sum;
for (i=1;i<=n;i++) scanf("%d",&a[i]);
if (n==1){
printf("%d %d\n",a[1],m);
}
else{
for (sum=0,i=1;i<=n-1;i++) sum=a[i]-a[i+1];
if(sum>=0){
int temp=0;
for (i=1;i<=n;i++){
if (m>=a[i]){
temp=i;
break;
}
else if (i==n && temp==0){
temp=n+1;
}
}
int flag =1;
for (i=1;i<=n;i++){
if (i==1){
if(temp ==i ){
printf("%d",m);
printf(" %d",a[i]);
flag=0;
}
else{
printf("%d",a[i]);
}
}
else{
if(temp==i){
printf(" %d %d",m,a[i]);
flag=0;
}
else printf(" %d",a[i]);
}
}
if (flag == 1) printf(" %d",m);
printf("\n");
}
else{
int temp=0;
for (i=1;i<=n;i++){
if (m<=a[i]){
temp=i;
break;
}
else if(i==n && temp==0){
temp = n+1;
}
}
int flag=1;
for (i=1;i<=n;i++){
if (i==1){
if(temp==i){
printf("%d %d",m,a[i]);
flag=0;
}
else{
printf("%d",a[i]);
}
}
else{
if(temp==i){
printf(" %d %d",m,a[i]);
flag=0;
}
else{
printf(" %d",a[i]);
}
}
}
if (flag==1) printf(" %d",m);
printf("\n");
}
}
}
return 0;
}