codeforces 679 B

只有2種情況，一直搜索下去就行了 ，一個是剩餘的數，一個是答案一，即block，一個是增加的用到的答案

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn=1e5+10;
ll fac[maxn];ll bcnt , bsum;
void dfs(ll remain , ll cnt , ll sum){
    if (remain <= 0) {
        if (cnt > bcnt){
            bcnt = cnt ; bsum = sum;
        }
        else if(cnt == bcnt && sum > bsum){
            bsum = sum ;
        }
        return ;
    }
//  cout<<" remain = "<<remain <<" cnt = "<< cnt <<" sum = "<<sum<<endl;
//  system (" pause ");
    int now = lower_bound(fac , fac + maxn - 5, remain) - fac;
    if(fac[now] > remain){
        now --;
    }
//  cout << "now = " << now <<endl;
//  cout << fac[now] << endl;
    //if(now == -1 ) dfs(0 , cnt + 1, sum + 1);
    dfs(remain - fac[now] , cnt + 1 ,sum + fac[now]);
    dfs(fac[now] - 1 - fac[now - 1], cnt + 1 ,sum + fac[now - 1]);

}
int main () {
//  fac[0] = 1;
    for(ll i = 1 ;i <= maxn - 5 ;i ++){
        fac[i] = i * i * i;
    }
    ll m;
    while(scanf("%lld" , &m) != EOF){
        bcnt = 0 ; bsum = 0;
        dfs(m , 0 , 0);
        cout << bcnt << " " <<bsum << endl;
    }

}