Submission

PPP----P-P

Score: 50

User: Nightingale

Problemset: Fool's Compensation

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-29 13:53:47

#include <bits/stdc++.h>
#define int long long
using namespace std;
int32_t main() 
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int a;
  cin >> a;
  if(a==1){
    cout << 1000;
    return 0;
  }
  vector<int> sales(a);
  for(int i=0;i<a;i++){
    cin >> sales[i];
  }
  int money = a*1000;
  int more = 0;
  int count = 0;
  int less = 0;
  int eq = 0;
  if(sales[0]>sales[1]) money+=1000;
  for(int i=1;i<a;i++){
    if(sales[i]>sales[i-1]){
      if(less==1) count = 0;
      if(eq==1) count = 0;
      more = 1;
      eq = 0;
      less = 0;
      count++;
      money = money+count*1000;
    }else if(sales[i]<sales[i-1]){
      if(more==1) count = 0;
      more = 0;
      eq = 0;
      less = 1;
      count++;
      if(count>=2) money = money+count*1000;
    }
    else{
      eq = 1;
      more = 0;
      less = 0;
      count++;
    }
  }
  cout << money;
}