CF1017 C. The Phone Number

C. The Phone Number
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Mrs. Smith is trying to contact her husband, John Smith, but she forgot the secret phone number!

The only thing Mrs. Smith remembered was that any permutation of n can be a secret phone number. Only those permutations that minimize secret value might be the phone of her husband.

The sequence of n integers is called a permutation if it contains all integers from 1 to n exactly once.

The secret value of a phone number is defined as the sum of the length of the longest increasing subsequence (LIS) and length of the longest decreasing subsequence (LDS).

A subsequence ai1,ai2,…,aik where 1≤i1<i2<…<ik≤n is called increasing if ai1<ai2<ai3<…<aik. If ai1>ai2>ai3>…>aik, a subsequence is called decreasing. An increasing/decreasing subsequence is called longest if it has maximum length among all increasing/decreasing subsequences.

For example, if there is a permutation [6,4,1,7,2,3,5], LIS of this permutation will be [1,2,3,5], so the length of LIS is equal to 4. LDS can be [6,4,1], [6,4,2], or [6,4,3], so the length of LDS is 3.

Note, the lengths of LIS and LDS can be different.

So please help Mrs. Smith to find a permutation that gives a minimum sum of lengths of LIS and LDS.

Input
The only line contains one integer n (1≤n≤105) — the length of permutation that you need to build.

Output
Print a permutation that gives a minimum sum of lengths of LIS and LDS.

If there are multiple answers, print any.

Examples
inputCopy
4
outputCopy
3 4 1 2
inputCopy
2
outputCopy
2 1
Note
In the first sample, you can build a permutation [3,4,1,2]. LIS is [3,4] (or [1,2]), so the length of LIS is equal to 2. LDS can be ony of [3,1], [4,2], [3,2], or [4,1]. The length of LDS is also equal to 2. The sum is equal to 4. Note that [3,4,1,2] is not the only permutation that is valid.

In the second sample, you can build a permutation [2,1]. LIS is [1] (or [2]), so the length of LIS is equal to 1. LDS is [2,1], so the length of LDS is equal to 2. The sum is equal to 3. Note that permutation [1,2] is also valid.

题目链接：CF1017

题意：让你用n个数，构造一个序列，使得这个序列最长上升子序列和最长下降子序列个数之和最小

思路：从案例就可以看出，要用到分块的思想，假设有k个块，设len为每个块的长度，那么最长上升子序列和最长下降子序列个数之和就是len+k，所以只要暴力枚举，看每个块分多少就可以了

AC代码：

#include<bits/stdc++.h>
#define LL long long
#define Max 100005
const LL mod=1e9+7;
const LL LL_MAX=9223372036854775807;
using namespace std;
int main()
{
    int n;
    scanf("%d",&n);
    int ans=INT_MAX;
    int index;
    for(int i=1;i<=sqrt(n);i++){
        if(ans>=(n+i-1)/i+i){//暴力枚举
            ans=(n+i-1)/i+i;
            index=i;
        }
    }
    for(int i=n;i>=1;i-=index){
        for(int j=i-index+1;j<=i;j++){
            if(j>0)
                printf("%d ",j);
        }
    }
    return 0;
}