算法分析
1.贪心
2.switch状态机
图解
代码
#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int N;
int a[100];
static const int BEGIN = 0;
static const int UP = 1;
static const int DOWN = 2; //BEGIN UP DOWN 对应数值变化的三种状态
int STATER = BEGIN;
int maximumNUM = 0;
int minimumNUM = 0;
int i;
int