2020ECNU机试01

发表于 | 分类于 | 评论数： | 热度： ℃
本文字数： 6.9k | 阅读时长 ≈ 6 分钟

Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include <iostream>
using namespace std;
int arr[100], arr1[100], arr2[100];
int countz = 0, countf = 0, zeroIndx = -1;

//正数升序
void incr() {
	bool flag;
	for (int i = 0;i < countz;i++) {
		flag = false;
		for (int j = 0;j < countz - i - 1;j++) {
			if (arr1[j]> arr1[j+1]) {
				int temp = arr1[j];
				arr1[j] = arr1[j + 1];
				arr1[j + 1] = temp;
				flag = true;
			}
		}
		if (!flag)
			break;
	}

}

//负数降序
void decr() {
	bool flag;
	for (int i = 0;i < countf;i++) {
		flag = false;
		for (int j = 0;j < countf - i - 1;j++) {
			if (arr2[j] < arr2[j + 1]) {
				int temp = arr2[j];
				arr2[j] = arr2[j + 1];
				arr2[j + 1] = temp;
				flag = true;
			}
		}
		if (!flag)
			break;
	}
}


int main() {
	int n,temp;
	scanf("%d",&n);
	
	for (int i = 0;i < n;i++) {
		//scanf("%d", &temp);
		cin >> temp;
		arr[i] = temp;
		if (temp > 0) {
			arr1[countz++] = temp;
		}else if (temp < 0)
			arr2[countf++] = temp;
		else
			zeroIndx = i;
	}

	incr();//对正数升序
	decr();//对负数降序
	int a = 0, b = 0;
	//正数升序，负数降序
	for (int i = 0;i < n;i++) {
		if (arr[i] > 0) {
			arr[i] = arr1[a++];
		}
		else if (arr[i] <0) {
			arr[i] = arr2[b++];
		}
	}

	for (int i = 0;i < n;i++) {
		if(i==0)printf("%d",arr[i]);
		else 
			printf(" %d",arr[i]);
	}

	return 0;
}

----\(˙<>˙)/----赞赏一下吧～