C++ 编程题：汉赛尔和格莱特分披萨

#include using namespace std;

int main() { int mushrooms[8]; int sum = 0; for (int i = 0; i < 8; i++) { cin >> mushrooms[i]; sum += mushrooms[i]; } int maxMushrooms = 0; for (int i = 0; i < 5; i++) { int currentMushrooms = 0; for (int j = i; j < i + 4; j++) { currentMushrooms += mushrooms[j]; } maxMushrooms = max(maxMushrooms, currentMushrooms); } cout << maxMushrooms << endl; return 0; }