题目:http://codeforces.com/contest/1017/problem/C
题意:给一个数n,要求排列1~n,使得最长递增子序列LIS+最长递减子序列LDS最小。
思路:结论:若 ,则 当且仅当 LIS == LDS 时,LIS+LDS 最小(由基本不等式)。此时取
分块情况如下图:
#include <bits/stdc++.h>
#pragma GCC optimize(3)
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#define pb push_back
#define mkp(a,b) make_pair(a,b)
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define fi first
#define se second
#define lc (d<<1) //d*2
#define rc (d<<1|1) //d*2+1
#define stn(a) setprecision(a)//小数总有效位数
#define stfl setiosflags(ios::fixed)//点后位数:cout<<stfl<<stn(a);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double PI=3.1415926535897932384626433832795;
const int MAXN=1e5+10;
const ll mod=1e9+7;
ll inline mpow(ll a,ll b){ll ans=1;a%=mod;while(b){if(b&1)ans=(ans*a)%mod;a=(a*a)%mod,b>>=1;}return ans;}
const int inf = 0x3f3f3f3f; //9
const ll inff = 0x3f3f3f3f3f3f3f3f; //18
int main()
{
fio;
int n; cin>>n;
int len=(int)sqrt(n),k=n/len;
if(k*len!=n) k++;
while(k)
{
for(int i=max(1,n-len+1);i<=n;i++) cout<<i<<" ";
n-=len;
k--;
}
return 0;
}