likmin / pat-first-division Goto Github PK

#include<iostream>
#include<vector>
using namespace std;
bool isSort(vector<int> v) {
	for (int i = 0; i < v.size() - 1; i++) {
		if (v[i] < v[i + 1])continue;
		else return false;
	}
	return true;
}
int main()
{
	int N, zero;//zero记录0的下标
	cin >> N;
	vector<int> v(N),D(N);
	for (int i = 0; i < N; i++) {
		cin >> v[i];
		D[v[i]]=i;
		if (v[i] == 0)zero = i;
	}
	int min = 0;
	int j = 1;
	while (!isSort(v)) {
		int i;
		if (zero== 0) {//此时v还不是有序序列，但是0的下标为0,所以找下一个最小的没有对号入座的
			while (v[j] == j)
				j++;
			i = D[j];
		}
		else 
			i = D[zero];
		swap(v[zero], v[i]);//交换0和i位置
		swap(D[v[zero]], D[v[i]]);//交换0和i的下标位置
		zero = i;
		min++;
	}
	printf("%d", min);
	return 0;
}

```
    A = stoll(s.substr(0, s.size() / 2));
cout << s.substr(0, s.size() / 2) << endl;
B = stoll(s.substr(s.size() / 2+1, s.size()));
cout << s.substr(s.size() / 2 , s.size()-1) << endl;

如果s=1234，那么A=0，B=12,不科学啊？直接输出 s.substr(0, s.size() / 2) 和s.substr(s.size() / 2 , s.size()-1)都很正确。
还有，如果s为两位数，程序就会崩溃

首先将最顶端的元素放到未排好序元素的最后一个元素交换。
其次按照大顶堆的定义重新调整顺序

if (a.net_worth != b.net_worth)
	return a.net_worth > b.net_worth;
if (a.age != b.age)
	return a.age < b.age;
if (strcmp(a.name, b.name) < 0)
	return true;
return false;

	int M, Amin, Amax;
	scanf("%d %d %d", &M, &Amin, &Amax);
	int start = 0,end=N-1;
	while (start<N&&P[start].age < Amin)
		start++;
	while (end>=0&&P[end].age > Amax)
		end--;
	printf("Case #%d:\n", i);
	if (start > end)printf("None");
	else {
		sort(P + start, P + end+1, cmp1);
		M = (M > end - start) ? end - start+1: M;
		for (int j = start; j <start+M; j++) {
			printf("%s %d %d\n", P[j].name, P[j].age, P[j].net_worth);
		}
	}
	sort(P, P + N, cmp);
}
return 0;

for (int i = 1; i <=N; i++) {
	scanf("%d", &a[i]);
	if (i == 1) {
		LeftMax[1] = a[1] - 1;
		continue;
	}
	if (a[i] > big) {
		LeftMax[i + 1] = a[i];
		big = a[i];
	}
	else LeftMax[i + 1] = LeftMax[i];
}
RightMin[N] = a[N]+1;
for (int i = N ; i >= 1; i--) {
	if (a[i] < small) {
		RightMin[i - 1] = a[i];
		small = a[i];
	}
	else RightMin[i - 1] = RightMin[i];
}

vector<int> v;
for (int i = 1; i <=N ; i++) {
	if (a[i]<=RightMin[i]&&a[i]>=LeftMax[i] ) {
		v.push_back(a[i]);	
	}
}
printf("%d\n",v.size());
sort(v.begin(), v.end());
int flag = 1;
for (int i = 0; i < v.size(); i++) {
	if (flag) {
		printf("%d", v[i]);
		flag = 0;
	}
	else {
		printf(" %d", v[i]);
	}
}
  printf("\n");
return 0;