PAT 1101

来源：互联网发布：医学手术视频软件编辑：程序博客网时间：2024/06/05 05:08

此题有毒,当时直接进行遍历分数没拿满,参考了一下菊苣的做法只要把当前最大和最小的遍历出来然后比最大的大比最小的小就可以出结果了,还有一个坑点就是第三个样例必须输出\n才可以拿到分数,ACM做多的人习惯性会加\n,PAT做多了就懒得加了,下附代码(有一定参考性)

#include <iostream>#include <string>#include <cstring>#include<cmath>#include <vector>#include <map>#include <stdio.h>using namespace std;#define MAX 100005#define INF 0x3f3f3f3fint Min(int a, int b) {return a < b?a:b;}int Max(int a, int b) {return a > b?a:b;}int N, a[MAX], mini[MAX], maxn[MAX], i;int main() {scanf("%d", &N);for (i = 1; i <= N; i++) {scanf("%d", &a[i]);}mini[N+1] = INF;a[N + 1] = INF;maxn[0] = 0;a[0] = 0;for (i = 1; i <= N; i++) {maxn[i] = Max(maxn[i - 1], a[i - 1]);}for (i = N; i >= 1; i--) {mini[i] = Min(mini[i + 1], a[i + 1]);}int res[MAX],cnt=0;for (i = 1; i <= N; i++) {if (a[i] > maxn[i] && a[i] < mini[i]) {res[cnt++] = a[i];}}printf("%d\n", cnt);if (cnt >= 1)printf("%d", res[0]);for (int i = 1; i<cnt; i++) {printf(" %d", res[i]);}printf("\n");return 0;}

0 0