Submission #707535

#	Time	Username	Problem	Language	Result	Execution time	Memory
707535		epicci23	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	32 ms	6864 KiB

Main

#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


inline void solve()
{
  int n=in();
  int arr[n+2];
  for(int i=1;i<=n;i++) arr[i]=in();
  
  int pre[n+2];pre[1]=0;
  int suf[n+2];suf[n]=0;

  for(int i=2;i<=n;i++) pre[i]=pre[i-1] + max(0LL,arr[i-1]-arr[i]+1);
  for(int i=n-1;i>=1;i--) suf[i]=suf[i+1] + max(0LL,arr[i+1] - arr[i] +1);
   
  int ans=min(pre[n],suf[1]);
  
  for(int i=1;i<=n;i++) ans=min(ans,max(pre[i],suf[i]));

  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message (stderr)

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

• Subtask 1: 40 / 40
• Subtask 2: 60 / 60