Submission

P---------

Score: 10

User: AungS8430

Problemset: Fool's Compensation

Language: cpp

Time: 0.004 second

Submitted On: 2025-03-19 08:37:26

#include <bits/stdc++.h>
using namespace std;

int main(void) {
  int n;
  cin >> n;
  vector<int> sales(n);
  vector<int> bonus(n, 1000);
  for (int i = 0; i < n; i++) cin >> sales[i];
  for (int i = 1; i < n; i++) {
    if (sales[i] == sales[i - 1]) bonus[i] = bonus[i - 1];
    else if (sales[i] > sales[i - 1]) bonus[i] = bonus[i - 1] + 1000;
  }
  for (int i = n - 2; i >= 0; i--) {
    if (sales[i] == sales[i + 1]) bonus[i] = bonus[i + 1];
    else if (sales[i] > sales[i + 1]) bonus[i] = max(bonus[i + 1], i > 0 ? bonus[i - 1] : INT_MIN) + 1000;
  }
  cout << reduce(bonus.begin(), bonus.end(), 0);
  return 0;
}