Submission #941787

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
941787	2024-03-09 12:09:48	Litusiano	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	67 ms	13012 KiB

Main

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
signed main(){
  int n; cin>>n;
  vector<int> v(n); for(int& i : v) cin>>i;
  // for(int i : v) cout<<i<<" "; cout<<endl;
  vector<int> dp(n,inf), dp1(n,inf), mx(n+1,0), mx1(n+1,0);
  dp[0] = 0;
  mx[0] = 0;
  vector<int> last(n+1,0), last1(n+1,0); // just add max(between act and last)
  for(int i = 1; i<n; i++){
    // cerr<<i<<" "<<v[i-1]<<" "<<dp[i-1]<<" "<<mx[i-1]<<endl;
    if(v[i] > v[i-1]){
      dp[i] = dp[i-1]; continue;
    }
    dp[i] = dp[i-1] + max(0ll, abs(v[i] - v[i-1])) + 1;
  }
  dp1[n-1] = 0;
  mx1[n] = 0;
  for(int i = n-2; i>=0; i--){
    // cerr<<"dp1 "<<i<<" "<<v[i]<<" "<<dp1[i+1]<<" "<<mx1[i+1]<<" ";
    if(v[i] > v[i+1]){
      dp1[i] = dp1[i+1]; continue;
    }
    dp1[i] = dp1[i+1] + max(0ll,(v[i+1]- v[i])) + 1;
  }
  // mx1[n] = v[n-1]; mx[0] = v[0];
  // for(int i : mx1) cout<<i<<" "; cout<<endl;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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