minimize_sum_of_len_of_max_inc_and_max_dec_subsequence.cpp

#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define fill(a,val) memset(a,val,sizeof(a))
#define pb  push_back
#define mp  make_pair
#define ff  first
#define ss  second
#define fastio() ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
const ll MOD     = 1000*1000*1000+7;
const ll INF     = 1ll*1000*1000*1000*1000*1000*1000 + 7;
const ll MOD2    = 998244353;
const ld PI  = 3.141592653589793;
ll gcd(ll a, ll b){if(!b)return a;return gcd(b, a % b);} 
ll power(ll x,ll y,ll p ){ll res=1;x%=p;while(y>0){if(y&1)res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;}
ll power1(ll x,ll y){ll res=1;while(y>0){if(y&1)res=(res*x);y=y>>1;x=(x*x);}return res;}
ll lcm(ll a , ll b){return (a*b)/gcd(a,b);}
int max(int a,int b){if(a>b)return a;return b;}
int min(int a,int b){if(a>b)return b;return a;}
bool sortbysec(const pair<ll,ll> &a, const pair<ll,ll> &b)
{
    return a.second<b.second;
}

int main(void){
    fastio();
    int n;
    cin>>n;
    int temp=sqrt(n);
    if(temp*(temp+1)<n)
    {
        int temp1=temp*(temp+1);
        for(int i=temp1+1;i<=n;i++)
        {
            cout<<i<<" ";
        }
        while(temp1>0)
        {
            for(int i=temp1-temp;i!=temp1+1;i++)
            {
                cout<<i<<" ";
            }
            temp1=temp1-temp-1;
        }
    }
    else
    {
        int temp1=n-temp*temp;
        while(temp1>0)
        {
            for(int i=n-temp;i!=n+1;i++)
            {
                cout<<i<<" ";
            }
            n=n-temp-1;
            temp1--;
        }
        while(n>0)
        {
            for(int i=n-temp+1;i!=n+1;i++)
            {
                cout<<i<<" ";
            }
            n=n-temp;
        }
    }
    
}