Submission #994046

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
#define int long long

const int INF = 1 << 30;

int N, A;
int dp1[1000001];
int dp2[1000001];

signed main()
{
  cin >> N >> A;

  if(N == 1) {
    cout << 1 << endl;
    return (0);
  }

  dp1[0] = 0;
  dp1[1] = 1;
  dp2[0] = 1;
  dp2[1] = 1;

  int syaku = 0;
  for(int j = 2; true; j++) {

    int syaku = 0;
    for(int i = 0; i < j; i++) {
      if(dp2[syaku] * (j - syaku) < dp2[i] * (j - i)) {
        syaku = i;
      }
    }
    dp1[j] = dp2[syaku] * (j - syaku);
    dp2[j] = max(dp2[j - 1], dp1[max(1LL, j - A)]);
    if(dp1[j] >= N) {
      cout << j << endl;
      return (0);
    }
  }

}

Submission Info

Judge Result