1045. 快速排序(25)

#include <iostream>#include <algorithm>#include <stdio.h>using namespace std;int N=0,num[100000]={0},bak[100000]={0},yes[100000]={0};//手写快排，需要加等于号的位置要特别注意！！！//一定不要用手写快排！！！//又慢又容易出错！！！int main(){  int i,j,count=0,max=0;    scanf("%d",&N);  i = 0;  while(i<N)  {    scanf("%d",&num[i]);    bak[i] = num[i];    i++;  }  sort(num,num+N);    for(i=0; i<N; i++)  {    if(bak[i]>max)      max = bak[i];    if((bak[i] == num[i]) && max == num[i])          yes[count++] = num[i];  }  printf("%d\n",count);  for(j=0; j<count; j++)  {    if(j == count-1)      printf("%d",yes[j]);    else      printf("%d ",yes[j]);  }  printf("\n");  return 0;}