2021-9

#include
using namespace std;

int main() {

  //n个自然数
  int n;
  //数组B
  int b[101] = { 0 };
  //最小总值、最大总值
  int numMin = 0, numMax = 0;

  //输入过程
  cin >> n;
  int pre = -1;
  for (int i = 0; i     cin >> b[i];
    numMax += b[i];
    if (b[i] != pre) {
      numMin += b[i];
      pre = b[i];
    }
  }

  //输出过程
  cout 
  return 0;
}

#include
#include
using namespace std;

//计算非零字段函数
int isnotZero(int a[],int n) {
  int count2 = 0;
  if (a[0] != 0)count2 = 1;
  for (int i = 1; i     if (a[i - 1] == 0 && a[i] != 0)
      count2++;
  }
  return count2;
}

int main() {

  //非零段个数
  int count = 0,count2 = 0;
  //数组a,数组b
  vector a,b;
  //n个自然数
  int n;
  int* p;

  //输入过程
  cin >> n;
  int  x;
  for (int i = 0; i     cin >> x;
    a.push_back(x);
  }
  
  count = isnotZero(&a[0], n);
  for (int i = 0; i     b = a;
    if (b[i] != 0) {
      for (int j = 0; j         if(b[j] == b[i])
          b[j] = 0;
      }
      count2 = isnotZero(&b[0], n);
    }
    if (count       count = count2;
    }
  }
  
  cout 
}