Submission #165268

#	Time	Username	Problem	Language	Result	Execution time	Memory
165268		Bojack	3단 점프 (JOI19_jumps)	C++14	27 / 100	84 ms	7144 KiB

jumps

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

void solve() {
  int n; scanf("%d", &n);
  vector <int> a(n);
  for(int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  int q; scanf("%d", &q);
  while(q--) {
    int l, r; scanf("%d", &l, &r);
  }
  stack <int> s;
  vector <pair <int, int>> can;
  for(int i = n - 1; i >= 0; i--) {
    while(!s.empty() and a[s.top()] < a[i]) {
      can.push_back({s.top(), i});
      s.pop();
    }
    if(!s.empty()) {
      can.push_back({i, s.top()});
    }
    s.push(i);
  }
  vector <int> mx(n);
  mx[n - 1] = a[n - 1];
  for(int i = n - 2; i >= 0; i--) {
    mx[i] = max(mx[i + 1], a[i]);
  }
  int ans = 0;
  for(auto p : can) {
    int i = p.first;
    int j = p.second;
    if(i > j) swap(i, j);
    if(j + j - i < n) ans = max(ans, a[i] + a[j] + mx[j + j - i]);
  }
  printf("%d\n", ans);
}

int main() {
  solve();
}

Compilation message (stderr)

jumps.cpp: In function 'void solve()':
jumps.cpp:15:33: warning: too many arguments for format [-Wformat-extra-args]
     int l, r; scanf("%d", &l, &r);
                                 ^
jumps.cpp:8:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int n; scanf("%d", &n);
          ~~~~~^~~~~~~~~~
jumps.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &a[i]);
     ~~~~~^~~~~~~~~~~~~
jumps.cpp:13:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int q; scanf("%d", &q);
          ~~~~~^~~~~~~~~~
jumps.cpp:15:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     int l, r; scanf("%d", &l, &r);
               ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 5
• Subtask 2: 0 / 14
• Subtask 3: 27 / 27
• Subtask 4: 0 / 54