Submission #941772

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
941772	2024-03-09 11:58:54	Litusiano	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	0 / 100	1 ms	600 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;
  vector<int> dp(n+1,inf), dp1(n+1,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-1] > mx[i-1]){
      mx[i] = v[i-1];
      dp[i] = dp[i-1]; continue;
    }
    int obj = mx[i-1] + 1;
    mx[i] = obj;
    dp[i] = dp[i-1] + abs(obj - v[i-1]);
  }
  dp1[n] = 0;
  mx1[n] = 0;
  for(int i = n-1; i>=0; i--){
    // cerr<<"dp1 "<<i<<" "<<v[i]<<" "<<dp1[i+1]<<" "<<mx1[i+1]<<" ";
    if(v[i] > mx1[i+1]){
      // cerr<<"not"<<endl;
      mx1[i] = v[i];
      dp1[i] = dp1[i+1];
      continue;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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