func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1e5 + 5;   long long t[N], dp[N];   int main() {     int n;     scanf( %d , &n);     for (int i = 1; i <= n; i++) {       scanf( %lld , &t[i]);     }     dp[0] = 0;     long long sum = 0;     for (int i = 1; i <= n; i++) {       dp[i] = dp[i - 1] + 20;       for (int j = i - 1; j >= 1; j--) {         if (t[i] - t[j] < 90)           dp[i] = min(dp[i], dp[j - 1] + 50);         else if (t[i] - t[j] < 1440)           dp[i] = min(dp[i], dp[j - 1] + 120);         else           break;       }       printf( %lld n , dp[i] - sum);       sum = dp[i];     }     return 0;   }   