text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
#define maxn 262144
using namespace std;
int read(){
int x=0,c;while(!isdigit(c=getchar()));
while(x=x*10+c-'0',isdigit(c=getchar()));
return x;
}
struct node{
int x,id;
}a[maxn];
bool cmp(node x,node y){
return x.x<y.x;
}
int n,m,k,vis[maxn],c[maxn],d[maxn],b[maxn];
int ans=1e9;
void work(){
int cnt=0,tot=0;
for(int i=1,j;i<=n;){
j=i;while(j<=n&&vis[j]==0)j++;
cnt=0;for(int t=i;t<j;t++)c[++cnt]=b[t];
sort(c+1,c+cnt+1);
for(int t=1;t<=cnt-m+1;t++)d[++tot]=c[t];
while(j<=n&&vis[j]==1)j++;
i=j;
}
sort(d+1,d+tot+1);
if(tot<k)return;
ans=min(ans,d[k]-d[1]);
}
int main(){
n=read();m=read();k=read();
for(int i=1;i<=n;i++)a[i].x=b[i]=read(),a[i].id=i;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
work();vis[a[i].id]=1;
}
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int s[2005];
int n,k,q;
int main()
{
cin>>n>>k>>q;
for(int i=1;i<=n;i++){
cin>>s[i];
}
ll ans=1ll<<50;
for(int i=1;i<=n;i++){
vector<int> v;
for(int j=1;j<=n;){
vector<int> c;
int z=j;
while(z<=n && s[z]>=s[i]) z++;
if(z-j>=k){
for(int o=j;o<z;o++){
c.push_back(s[o]);
}
sort(c.begin(),c.end());
for(int o=0;o<z-j-k+1;o++){
v.push_back(c[o]);
}
}
if(j==z) z++;
j=z;
}
if(v.size()>=q){
sort(v.begin(),v.end());
ans=min(ans,0ll+v[q-1]-v[0]);
}
}
cout<<ans;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,k,q,a[10005],b[10005],ans=1e9;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
bool check(int l,int r){
int p=0,j,t,s=0;
for(int i=1;i<=n+1;++i)
if(a[i]<b[l]){
for(t=0,j=p;++j<i;)if(a[j]<=b[r])++t;
s+=max(0,min(t,i-p-k));p=i;
}
return s>=q;
}
int main(){
n=read(),k=read(),q=read();
for(int i=1;i<=n;++i)a[i]=read(),b[i]=a[i];
sort(b+1,b+n+1);
for(int i=1,j=1;i<=n;++i){
while(j<=n&&!check(i,j))++j;
if(j<=n)ans=min(ans,b[j]-b[i]);
}
printf("%d",ans);
} |
#include<bits/stdc++.h>
using namespace std;
int read(){int k;scanf("%d",&k);return k;}
const int maxx = 40001;
struct A{int v,id;}a[maxx];
int V[maxx];
int n,k,Q;
int x1,f[maxx];
int q[maxx],ans=1000000000;
int tail=0;
int flag[maxx];
int aa[maxx];
int top=0;
void slove(){
tail=0;top=0;
for(int i=1;i<=n;i++){
if(V[i]<x1)f[i]=1;
if(f[i]==0){aa[++top]=V[i];}
if(f[i]==1||i==n){if(top<k){top=0;continue;}
sort(aa+1,aa+top+1);
for(int i=1;i<=top-k+1;i++){
q[++tail]=aa[i];
}top=0;
}
}
if(tail<Q)return ;
sort(q+1,q+tail+1);
ans=min(ans,q[Q]-x1);
return ;
}
int main(){
n=read();k=read();Q=read();
for(int i=1;i<=n;i++)V[i]=read();
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)f[j]=0;
x1=V[i];
slove();
}
cout<<ans<<endl;
return 0;
} |
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
int main(){
int n, k, q;
cin >> n >> k >> q;
set<int> all;
vector<int> a(n);
for(int i = 0; i < n; i++) cin >> a[i], all.insert(a[i]);
all.insert(0);
int ans = 1<<30;
for(int piv : all){
multiset<int> res, tmp;
for(int i = 0; i <= n; i++){
if(i == n || a[i] <= piv){
while(tmp.size() >= k) res.insert(*tmp.begin()), tmp.erase(tmp.begin());
tmp.clear();
}else{
tmp.insert(a[i]);
}
}
if(res.size() >= q){
auto it = res.begin();
int low = *it;
for(int i = 0; i < q-1; i++) it++;
ans = min(ans, *it-low);
}
}
cout << ans << endl;
}
|
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
priority_queue <int> q;
int a[101010],c[2020];
int main()
{
int ans,cnt,i,k,p,mx,mn,tmp,n,j,sum=0;
ans=1000000007;
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
scanf("%d%d%d",&n,&k,&p);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
}
for(i=1;i<=n;i++)
{
cnt=0;
sum=0;
for(j=1;j<=n;j++)
{
if(a[j]>=a[i])
{
q.push(-a[j]);
sum++;
if(sum>=k)
{
tmp=q.top();
tmp=-tmp;
c[++cnt]=tmp;
q.pop();
}
}
else
{
while(!q.empty())
q.pop();
sum=0;
}
}
if(cnt>=p)
{
sort(c+1,c+cnt+1);
ans=min(ans,c[p]-a[i]);
}
// printf("%d %d\n",i,ans);
while(!q.empty())
q.pop();
memset(c,0,sizeof(c));
}
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int Maxn=2001;
int a[Maxn],n,f,q;
void init(){
cin>>n>>f>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
}
}
int main(){
init();
int x,y,ans=2147483647;
for(int i=1;i<=n;i++){
x=a[i];
int l[n+1],r[n+1];
memset(l,0,sizeof(l));
memset(r,0,sizeof(r));
l[1]=1; int c=1;
for(int j=1;j<=n;j++){
if(a[j]<x){
if(a[j-1]>=x)r[c]=j-1;
if(j!=n&&a[j+1]>=x)l[++c]=j+1;
}
}
if(a[n]>=x)r[c]=n;
/*for(int j=1;j<=c;j++){
cout<<l[j]<<' '<<r[j]<<endl;
}*/
int e[n+1],tot=0;
memset(e,0,sizeof(e));
for(int j=1;j<=c;j++){
int w[n+1],size=r[j]-l[j]+1;
for(int k=l[j];k<=r[j];k++)
w[k-l[j]]=a[k];
sort(w,w+size);
for(int k=0;k<=size-f;k++){
e[++tot]=w[k];
}
}
sort(e+1,e+tot+1);
y=e[q];
//cout<<x<<' '<<y<<endl;
if(e[q]==0)continue ;
ans=min(ans,y-x);
}
cout<<ans;
} |
#include<stdio.h>
#include<algorithm>
using namespace std;
const int inf=2147483647;
int a[2010],t[2010],al[2010],n,k,q;
int work(int x){
int i,j,s,M;
s=M=0;
for(i=1;i<=n+1;i++){
if(a[i]>=a[x]){
if(s==0)s=i;
}else if(s){
if(i-s>=k){
for(j=s;j<i;j++)t[j-s+1]=a[j];
sort(t+1,t+i-s+1);
for(j=1;j+k-1<=i-s;j++){
M++;
al[M]=t[j];
}
}
s=0;
}
}
if(M<q)return inf;
sort(al+1,al+M+1);
return al[q]-a[x];
}
int main(){
int i,ans;
scanf("%d%d%d",&n,&k,&q);
for(i=1;i<=n;i++)scanf("%d",a+i);
ans=inf;
for(i=1;i<=n;i++)ans=min(ans,work(i));
printf("%d",ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2010;
int N;
int K;
int Q;
int A[MAXN];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> N >> K >> Q;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int ans = 2e9;
for (int z = 0; z < N; z++) {
int mi = A[z];
vector<int> buf;
vector<int> cnds;
for (int i = 0; i <= N; i++) {
if (i == N || A[i] < mi) {
if (int(buf.size()) >= K) {
int cnt = int(buf.size()) - K + 1;
nth_element(buf.begin(), buf.begin() + cnt, buf.end());
cnds.insert(cnds.end(), buf.begin(), buf.begin() + cnt);
}
buf.clear();
} else {
buf.push_back(A[i]);
}
}
if (int(cnds.size()) >= Q) {
nth_element(cnds.begin(), cnds.begin() + Q-1, cnds.end());
ans = min(ans, cnds[Q-1] - mi);
}
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
#define F(i,a,b) for(int i=(a);i<=(b);++i)
#define F_(i,a,b) for(int i=(a);i>=(b);--i)
#define G(i,u) for(int i=head[u];i;i=nxt[i])
template<typename T> inline T max(T& a, T b) { return a>b?a:a=b; }
template<typename T> inline T min(T& a, T b) { return a<b?a:a=b; }
const int N = 2005;
int a[N], b[N], c[N], ans;
int main() {
ans = 0x7fffffff;
int n, k, q;
scanf("%d%d%d", &n, &k, &q);
F(i,1,n) scanf("%d", &a[i]);
F(i,1,n) {
int x = a[i], tot = 0;
F(j,1,n) {
int st = j, siz = 0;
if(a[st] < x) continue;
b[siz++] = a[st];
while(j<n && a[j+1]>=x) b[siz++] = a[++j];
std::sort(b,b+siz);
for(int l = 0; l <= siz-k; ++ l) c[tot++] = b[l];
}
std::sort(c,c+tot);
if(q <= tot) ans = std::min(ans,c[q-1]-x);
}
printf("%d\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
long long n, k, q;
vector<long long> a;
long long solve();
int main() {
cin >> n >> k >> q;
a.resize(n);
for(int i = 0; i < n; ++i) cin >> a[i];
cout << solve() << endl;
return 0;
}
long long solve() {
long long ans = (long long)1e16;
for(int i = 0; i < n; ++i) {
long long minnum = a[i];
vector<long long> now;
for(int id = 0; id < n; ++id) {
priority_queue<long long, vector<long long>,
greater<long long>>
pq;
while(id < n && a[id] >= minnum) pq.push(a[id++]);
while(pq.size() >= k) {
now.push_back(pq.top());
pq.pop();
}
}
if(now.size() < q) continue;
sort(now.begin(), now.end());
ans = min(ans, now[q - 1] - minnum);
}
return ans;
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main(){
ll n,k,q,A[200001],ans=1e18;
cin>>n>>k>>q;
rep(i,n) cin>>A[i];
rep(i,n){
vec B,C;
ll a=0;
rep(j,n){
if(A[j]>=A[i]) B.push_back(A[j]);
if(A[j]<A[i]||j==n-1){
sort(all(B));
rep(l,max(0,int(B.size()-k+1))) C.push_back(B[l]);
B.clear();
}
}
sort(all(C));
if(C.size()>=q){
rep(j,q) a=max(a,C[j]);
ans=min(ans,a-A[i]);
}
}
cout<<ans;
} |
#include <bits/stdc++.h>
using namespace std;
int n, m, k, q, a[2004], b[2004];
int main() {
cin >> n >> k >> q;
for (int i=0; i<n; i++) cin >> a[i], b[i] = a[i];
sort(b, b+n);
m = unique(b, b+n) - b;
int ans = 2e9;
for (int i=0; i<m; i++) {
vector<int> v, u;
for (int j=0; j<=n; j++) {
if (a[j] < b[i]) {
sort(v.begin(), v.end());
for (int t=0; t<(int)v.size()-k+1; t++) u.push_back(v[t]);
v.clear();
} else v.push_back(a[j]);
}
sort(u.begin(), u.end());
if (u.size() >= q) ans = min(ans, u[q-1] - b[i]);
}
cout << ans;
}
|
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;int n,k,q,a[2005],b[2005];
inline bool chk(int l,int r) {int ans=0,cnt1=0,cnt2=0;
for (register int i=1;i<=n;++i) {
if (l<=a[i]&&a[i]<=r) ++cnt1,++cnt2;
else if (l<=a[i]) ++cnt2;
else ans+=max(0,min(cnt2-k+1,cnt1)),cnt1=cnt2=0;
}return ans+max(0,min(cnt2-k+1,cnt1))>=q;
}int main() {int ans=0x3f3f3f3f;scanf("%d%d%d",&n,&k,&q);
for (register int i=1;i<=n;++i) scanf("%d",a+i),b[i]=a[i];
sort(b+1,b+n+1);for (register int i=1;i<=n;++i) {int l=i,r=n,mid;
while (l<=r) mid=l+r>>1,(chk(b[i],b[mid])?ans=min(ans,b[mid]-b[i]),r=mid-1:l=mid+1);
}printf("%d",ans);return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[])
{
int n,k,q;
cin>>n>>k>>q;
int a[n];
for (int i = 0; i < n; ++i)
{
cin>>a[i];
}
int ans=1000000000;
for (int i = 0; i < n; ++i)
{
vector<int> tmp1,tmp2;
for (int j = 0; j < n; ++j)
{
if (a[i]>a[j])
{
if (tmp1.size()>=k)
{
sort(tmp1.begin(), tmp1.end());
int cnt=(int)tmp1.size()-k+1;
for (int l = 0; l < cnt; ++l)
{
tmp2.push_back(tmp1.at(l));
}
}
tmp1={};
}
else
{
tmp1.push_back(a[j]);
}
}
if (tmp1.size()>=k)
{
sort(tmp1.begin(), tmp1.end());
int cnt=(int)tmp1.size()-k+1;
for (int l = 0; l < cnt; ++l)
{
tmp2.push_back(tmp1.at(l));
}
}
if (tmp2.size()>=q)
{
sort(tmp2.begin(), tmp2.end());
ans=min(ans,tmp2.at(q-1)-tmp2.at(0));
}
}
cout<<ans<<endl;
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1000000007LL;
ll A[2000];
int main() {
ll N, K, Q;
cin >> N >> K >> Q;
ll ma = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
ma = max(ma, A[i]);
}
ll ans = 1 << 30;
for (int i = 0; i < N; i++) {
ll l = A[i] - 1, r = ma + 1;
bool ok = 0;
while (r - l > 1) {
ll m = (l + r) / 2;
ll cnt = 0;
ll len = 0;
ll sum = 0;
for (int j = 0; j < N; j++) {
if (A[j] < A[i]) {
sum += min(cnt, max(len - K + 1, 0LL));
len = 0;
cnt = 0;
}
else {
len++;
if (A[j] <= m) cnt++;
}
}
sum += min(cnt, max(len - K + 1, 0LL));
if (sum >= Q) r = m, ok = 1;
else l = m;
}
if (ok) ans = min(ans, r - A[i]);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2010;
int n, k, q, a[maxn], ans = 2e9;
int b[maxn], bcnt, c[maxn], ccnt;
void calc() {
sort(b + 1, b + bcnt + 1);
for (int i = 1; i <= bcnt - k + 1; ++i) c[++ccnt] = b[i];
}
void solve(int v) {
bcnt = ccnt = 0;
for (int i = 1; i <= n; ++i)
if (a[i] >= v) b[++bcnt] = a[i];
else if (bcnt) {
calc(); bcnt = 0;
}
if (bcnt) calc();
sort(c + 1, c + ccnt + 1);
if (q <= ccnt) ans = min(ans, c[q] - v);
}
int main() {
scanf("%d%d%d", &n, &k, &q);
for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
for (int i = 1; i <= n; ++i)
solve(a[i]);
printf("%d", ans);
}
|
#include<bits/stdc++.h>
#define mx 100005
using namespace std;
int n, k, q, a[mx], b[mx], ans = 1000000007;
int main(){
scanf("%d%d%d", &n, &k, &q);
for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
copy(a, a+n, b);
sort(b, b+n);
for (int i = 0; i < n; i++) {
int j = 0;
vector<int> sm;
while(j < n){
vector<int> v;
int l = 0;
for(; j + l < n && a[j + l] >= b[i]; l++);
if(l){
v.insert(v.begin(), a+j, a+j+l);
sort(v.begin(), v.end());
if(v.size() >= k){
sm.insert(sm.end(), v.begin(), v.end() - k + 1);
}
}else l = 1;
j += l;
}
if(sm.size() < q) break;
sort(sm.begin(), sm.end());
ans = min(ans, sm[q-1] - sm[0]);
}
printf("%d\n", ans);
} |
#include<iostream>
#include<algorithm>
#include<vector>
#include<numeric>
using namespace std;
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for (auto & e : A) cin >> e;
A.push_back(0);//番兵
vector<int> removable;
vector<int> tmp;
int ans = 1000*1000*1000 + 1;
for (const auto& x : A) {
if (x == 0) continue;//breakでも同じだが。
for (const auto & e : A) {
if (e >= x) {
tmp.push_back(e);
continue;
}
if (tmp.size() >= K) {
sort(tmp.begin(), tmp.end());
for (int i = 0; i < tmp.size() - K + 1; ++i) {
removable.push_back(tmp[i]);
}
}
tmp.clear();
}
if (removable.size() >= Q) {
sort(removable.begin(), removable.end());
ans = min(ans, removable[Q - 1] - removable[0]);
}
removable.clear();
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using P = pair<int,int>;
const int INF = 1e9;
int main(){
int n, k, q;
cin >> n >> k >> q;
int a[n];
P b[n];
rep(i,n) {
cin >> a[i];
b[i] = P(a[i],i);
}
sort(b,b+n);
vector<int> v;
int ans = INF;
v.push_back(-1); v.push_back(n);
rep(i,n) {
vector<vector<int>> p(v.size()-1);
vector<int> r;
rep(j,v.size()-1) {
for(int l = v[j]+1; l < v[j+1]; l++) p[j].push_back(a[l]);
sort(p[j].begin(),p[j].end());
rep(l,p[j].size()-k+1) r.push_back(p[j][l]);
}
sort(r.begin(),r.end());
if(r.size() >= q) ans = min(ans,r[q-1]-r[0]);
v.push_back(b[i].second);
sort(v.begin(),v.end());
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)
int n,k,q;
int res = 1e9;
vector<int> a;
void solve(int x){
vector<int> s;
priority_queue<int,vector<int>,greater<int>> qu;
rep(i,n+1){
if(a[i] < x){
while(!qu.empty()){
if(qu.size() >= k){
s.push_back(qu.top());
}
qu.pop();
}
}else{
qu.push(a[i]);
}
}
if(s.size() < q) return;
sort(s.begin(), s.end());
res = min(res, s[q-1]-x);
}
int main(void){
cin>>n>>k>>q;
a.resize(n);
rep(i,n) cin>>a[i];
a.push_back(0);
rep(i,n) solve(a[i]);
cout<<res<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans = INT_MAX;
for (int i = 0; i < n; ++i) {
int x = a[i];
multiset<int> s;
vector<int> sm;
for(int j = 0; j < n; ++j) {
if (a[j] < x) {
while ((int)s.size() >= k) {
sm.push_back(*s.begin());
s.erase(s.begin());
}
s.clear();
} else {
s.insert(a[j]);
}
}
while ((int)s.size() >= k) {
sm.push_back(*s.begin());
s.erase(s.begin());
}
s.clear();
sort(sm.begin(), sm.end());
if ((int)sm.size() >= q) {
ans = min(ans, sm[q-1] - sm[0]);
}
}
cout << ans << '\n';
} |
#include<algorithm>
#include<cstdio>
#define N 2005
using namespace std;
int a[N],l[N],n,o,q,r[N],s[N],t,x;bool w[N],z[N];
inline bool cmp(int u,int v){return a[u]<a[v];}
int main()
{
scanf("%d%d%d",&n,&o,&q),x=0x7fffffff,w[n+1]=true;
for(int i=1;i<=n;i++)scanf("%d",a+i),r[i]=n+1;
for(int i=1,j,k,u;i<=n;i++)
{
u=t=0,j=1;
while(w[j])j++;
while(j<=n)
{
k=j;
while(!w[k])s[++t]=k++;
if(k-j<o)t-=k-j;
else sort(s+t+1-k+j,s+t+1,cmp),t-=o-1;
j=k;
while(w[j])j++;
}
if(t<q)break;
sort(s+1,s+t+1,cmp);
if(a[s[q]]-a[s[1]]<x)x=a[s[q]]-a[s[1]];
w[s[1]]=true;
}
printf("%d\n",x);
return 0;
} |
/*Lucky_Glass*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int MAXN=2000;
const int INF=(int)1e9+5;
int n,k,q,A[MAXN+5],ans=INF;
void SOLVE(int x)
{
vector<int> pri;
int i=0;
while(i<n)
{
vector<int> que;
while(A[i]<x && i<n) i++;
while(A[i]>=x && i<n) que.push_back(A[i++]);
if(que.size()>=k)
{
sort(que.begin(),que.end());
for(int j=0;j<(int)que.size()-k+1;j++)
pri.push_back(que[j]);
}
}
sort(pri.begin(),pri.end());
if((int)pri.size()>=q)
ans=min(ans,pri[q-1]-pri[0]);
}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=0;i<n;i++)
scanf("%d",&A[i]);
for(int i=0;i<n;i++)
SOLVE(A[i]);
printf("%d\n",ans);
return 0;
}
|
#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#define MAX_N 2005
#define INF 1000000000
using namespace std;
int n,K,q,ans=INF;
int a[MAX_N];
int t[MAX_N];
int w[MAX_N];
int main()
{
scanf("%d%d%d",&n,&K,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
{
int cnt=0,tot=0;
for(int j=1;j<=n+1;j++)
{
if(a[j]<a[i])
{
if(cnt>=K)
{
nth_element(t+1,t+cnt-K+1,t+1+cnt);
for(int k=1;k<=cnt-K+1;k++) w[++tot]=t[k];
}
cnt=0;
}
else t[++cnt]=a[j];
}
if(tot>=q)
{
nth_element(w+1,w+q,w+1+tot);
ans=min(ans,w[q]-a[i]);
}
}
printf("%d\n",ans);
}
|
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0,i##_cond=(n);i<i##_cond;++i)
#define all(a) (a).begin(),(a).end()
#define sz(x) ((ll)(x).size())
#define pb push_back
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
const ll inf = 1ll<<62;
int main(){
#define int ll
int n,k,q; cin >> n >> k >> q;
vi a(n); rep(i,n) cin >> a[i];
int res = inf;
rep(minpos,n){
vvi tmp(n);
int m = 0;
rep(i,n){
if(a[i] >= a[minpos]) tmp[m].pb(a[i]);
else m++;
}
m++;
rep(i,m) sort(all(tmp[i]));
vi take;
rep(i,m) rep(j,sz(tmp[i])-k+1) take.pb(tmp[i][j]);
sort(all(take));
if(sz(take) >= q) res = min(res, take[q-1] - a[minpos]);
}
cout << res << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int INF=(2e9);
const int maxn=2010;
int n,k,q,a[maxn],ans,b[maxn],res[maxn];
int solve(int x) {
int s=-1,sz=0;
for (int i=1;i<=n+1;i++)
if (a[i]>=a[x]) {
if (s==-1) s=i;
}
else if (s!=-1) {
if (i-s>=k) {
for (int j=s;j<i;j++) b[j-s+1]=a[j];
sort(b+1,b+(i-s+1));
for (int j=1;j+k-1<=i-s;j++) res[++sz]=b[j];
}
s=-1;
}
if (sz<q) return INF;
sort(res+1,res+(sz+1));
return res[q]-a[x];
}
int main() {
//freopen("1.txt","r",stdin);
scanf("%d %d %d",&n,&k,&q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]);
ans=INF;
for (int i=1;i<=n;i++) ans=min(ans,solve(i));
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = (int) 2e9;
for (int bound : a) {
vector<int> c;
multiset<int> s;
for (int i = 0; i <= n; i++) {
if (i == n || a[i] < bound) {
sort(c.begin(), c.end());
for (int j = 0; j <= (int) c.size() - k; j++) {
s.insert(c[j]);
}
c.clear();
} else {
c.push_back(a[i]);
}
}
if ((int) s.size() < q) {
continue;
}
auto it = s.begin();
for (int i = 0; i < q - 1; i++) {
it++;
}
ans = min(ans, *it - bound);
}
cout << ans << '\n';
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
#define N 3000
#define INF 0x3f3f3f3f
int n,m,p,ans,a[N],b[N],c[N];
int main(){
scanf("%d%d%d",&n,&m,&p);
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
ans=INF;
for (int i=1;i<=n;++i){
int xb=0,tot=0;
for (int j=1;j<=n;++j)
if (a[j]>=a[i]) b[++xb]=a[j];
else{
sort(b+1,b+xb+1);
for (int k=1;k+m-1<=xb;++k) c[++tot]=b[k];
xb=0;
}
sort(b+1,b+xb+1);
for (int k=1;k+m-1<=xb;++k) c[++tot]=b[k];
if (tot>=p){
sort(c+1,c+tot+1);
ans=min(ans,c[p]-c[1]);
}
}
printf("%d\n",ans);
return 0;
}
|
#include<bits/stdc++.h>
using lint=long long;
using real=long double;
void cmn(lint&x,lint y){if(x>y)x=y;}
int main(){
std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);
std::cout.setf(std::ios_base::fixed);std::cout.precision(15);
lint n,k,q;std::cin>>n>>k>>q;
std::vector<lint>a(n);
for(lint&x:a)std::cin>>x;
lint ans=std::numeric_limits<lint>::max();
for(lint Y:a){
std::vector<lint>b;
for(lint l=0,r=0;l<n;){
for(l=r;l<n&&a.at(l)<Y;l++);
for(r=l;r<n&&Y<=a.at(r);r++);
if(r-l<k)continue;
std::vector<lint>c={a.begin()+l,a.begin()+r};
std::sort(c.rbegin(),c.rend());
b.insert(b.end(),c.begin()+k-1,c.end());
}
if((lint)b.size()<q)continue;
std::sort(b.begin(),b.end());
cmn(ans,b.at(q-1)-Y);
}
std::cout<<ans<<'\n';
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const ll INF = 1LL << 60; //MAX 9223372036854775807
ll ans = INF;
int main()
{
ll n , k , q ;
cin >> n >> k >> q ;
vector<ll> a(n);
rep(i, n){
cin >> a[i];
}
rep(i,n){
ll mi=a[i];
vector<ll> v;
vector<ll> te;
rep(j,n+1){
if(j==n||a[j]<mi){
if(te.size()>=k){
sort(te.begin(),te.end());
rep(l,te.size()-k+1)v.push_back(te[l]);
}
te.clear();
}
else{
te.push_back(a[j]);
}
}
sort(v.begin(),v.end());
if(v.size()>=q)ans=min(ans,v[q-1]-v[0]);
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int M=2e3+5;
int que[M],order[M],tmp[M],now[M],tot,top,n,k,q;
void in()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;++i)scanf("%d",&que[i]),order[i]=que[i];
}
void add(int le,int ri)
{
tot=0;
if(le>ri||ri-le+1<k)return;
for(int i=le;i<=ri;++i)tmp[++tot]=que[i];
sort(tmp+1,tmp+1+tot);
for(int i=ri-le+2-k;i>=1;--i)now[++top]=tmp[i];
}
int test(int mn)
{
int p=1;top=0;
for(int i=1;i<=n;++i)if(que[i]<mn)add(p,i-1),p=i+1;
if(top<q)return INT_MAX;
sort(now+1,now+1+top);
return now[q]-mn;
}
void ac()
{
int ans=INT_MAX;
sort(order+1,order+1+n);que[++n]=-INT_MAX;
for(int i=1;i<n;++i)ans=min(test(order[i]),ans);
printf("%d",ans);
}
int main()
{
in();ac();
return 0;
} |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for (int i = 0; i < N; ++i) cin >> A[i];
int ret = (1 << 30);
for (int i = 0; i < N; ++i) {
vector<int> candy, cur;
for (int j = 0; j <= N; j++) {
if (j == N || A[j] < A[i]) {
sort(cur.begin(), cur.end());
if (cur.size() >= K) candy.insert(candy.end(), cur.begin(), cur.end() - K + 1);
cur.clear();
}
else cur.push_back(A[j]);
}
sort(candy.begin(), candy.end());
if (candy.size() >= Q) ret = min(ret, candy[Q - 1] - A[i]);
}
cout << ret << '\n';
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,k,q,a[2005],ans=0x7fffffff,t[2005],b[2005],c[2005];
inline int min(int x,int y){
return x<y?x:y;
}
void solve(int mn){
int l=1,r=1,tot=0;
while(l<=n){
int cnt=0;
while(l<=n&&a[l]<mn) l++;
r=l;
while(r<=n&&a[r]>=mn) r++;
for(int i=l;i<=n&&i<r;i++)
c[++cnt]=a[i];
if(cnt>=k){
sort(c+1,c+cnt+1);
for(int i=1;i<=cnt-k+1;i++)
b[++tot]=c[i];
}
l=r;
}
sort(b+1,b+tot+1);
if(tot>=q) ans=min(ans,b[q]-b[1]);
}
int main(){
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
t[i]=a[i];
}
sort(t+1,t+n+1);
for(int i=1;i<=n;i++) solve(t[i]);
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int a[2222];
int main()
{
int n, k, q;
cin >> n >> k >> q;
for (int i = 0; i < n; i++)
cin >> a[i];
int m = 2e9;
for (int i = 0; i < n; i++) {
vector<int> b;
for (int s = 0, t; s < n; s = t + 1) {
for (t = s; t < n&&a[t] >= a[i]; t++);
if (t - s < k) continue;
b.insert(b.end(), a + s, a + t);
sort(b.end() - (t - s), b.end());
b.erase(b.end() - (k - 1), b.end());
}
sort(b.begin(), b.end());
if (b.size() >= q)
m = min(m, b[q - 1] - b[0]);
}
cout << m << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define inf 0x7f7f7f7f
const int N=2100;
int n,k,q,x,y,ans=inf;
int a[N];
priority_queue<int,vector<int>,greater<int> >que;
multiset<int>lans;
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++)scanf("%d",a+i);
for(int i=1;i<=n;i++)
{
x=a[i];y=inf;
lans.clear();
que=priority_queue<int,vector<int>,greater<int> >();
for(int j=1;j<=n+1;j++)
if(j>n||a[j]<x)
{
while(que.size()>=k)
{
lans.insert(que.top());
que.pop();
}
que=priority_queue<int,vector<int>,greater<int> >();
}
else que.push(a[j]);
int cnt=1;
for(auto it=lans.begin();it!=lans.end();it++,cnt++)
if(cnt==q){y=*it;break;}
//printf("%d %d\n",x,y);
ans=min(y-x,ans);
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define F first
#define S second
using namespace std;
typedef pair<int,int> P;
const int MOD=1000000007;
int INF=100100100100100;
int a[2010];
signed main(){
int n,k,q;cin>>n>>k>>q;
int ans=INF;
rep(i,n)cin>>a[i];
rep(ima,n){
vector<int> res;
vector<int> v;
rep(i,n){
if(a[i]>=a[ima])v.pb(a[i]);
if(a[i]<a[ima] || i==n-1){
if(v.size()>=k){
int m=v.size();
sort(all(v));
rep(po,m-k+1){
res.pb(v[po]);
}
}
v.clear();
}
}
if(res.size()>=q){
sort(all(res));
ans=min(ans,res[q-1]-res[0]);
}
}
cout<<ans<<endl;
return 0;
} |
#include<cstdio>
#include<algorithm>
int n,k,q,a[2005];
int ls[2005],st[2005],con;
int work(int mini){
int last=-1;
con=0;
for(int i=1;i<=n;i++) ls[i]=a[i];
for(int i=1;i<=n+1;i++){
if(a[i]>=mini&&last==-1) last=i;
if(a[i]<mini&&~last){
std::sort(ls+last,ls+i);
for(int j=last;j<=i-k;j++) st[con++]=ls[j];
last=-1;
}
}
if(con<q) return 0x3f3f3f3f;
std::sort(st,st+con);
return st[q-1]-mini;
}
int main(){
scanf("%d%d%d",&n,&k,&q);
a[n+1]=-1;
int ans=0x3f3f3f3f;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
ans=std::min(ans,work(a[i]));
printf("%d\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2005;
int n, k, q;
int a[MAXN];
int dx[MAXN], top = 0;
void work(int L, int R)
{
if (L > R) return;
static int stk[MAXN];
int stk_top = 0, len = R-L+1;
for (int i = L; i <= R; i++) stk[++stk_top] = a[i];
sort(stk+1, stk+stk_top+1);
for (int i = 1; i <= len-k+1; i++)
dx[++top] = stk[i];
}
int main()
{
scanf("%d%d%d", &n, &k, &q);
for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
int ans = 1e9;
for (int i = 1; i <= n; i++) {
int last = 0;
top = 0;
for (int j = 1; j <= n; j++) {
if (a[j] < a[i]) {
work(last+1, j-1);
last = j;
}
}
work(last+1, n);
sort(dx+1, dx+top+1);
if (top >= q) ans = min(ans, dx[q]-dx[1]);
}
cout << ans << endl;
return 0;
}
|
// E.
#include <iostream>
#include <sstream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
int main(int argc, char *argv[])
{
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int ans = 1 << 30;
for (int i = 0; i < n; ++i) {
vector<int> x, y;
for (int j = 0; j <= n; ++j) {
if (j == n || a[j] < a[i]) {
if (y.size() >= k) {
sort(y.begin(), y.end());
x.insert(x.end(), y.begin(), y.end() - k + 1);
}
y.clear();
} else {
y.push_back(a[j]);
}
}
if (x.size() >= q) {
sort(x.begin(), x.end());
ans = min(ans, x[q - 1] - x[0]);
}
}
cout << ans << endl;
}
|
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int d[202020];
int main()
{
int num, len, query;
scanf("%d%d%d", &num, &len, &query);
for (int i = 0; i < num; i++)scanf("%d", &d[i]);
int mini = 2020202020;
d[num] = -2020202020;
for (int i = 0; i < num; i++)
{
int pt = 0;
vector<int>v;
for (int j = 0; j <= num; j++)
{
if (d[i] > d[j])
{
if (j - pt >= len)
{
vector<int>t;
for (int k = pt; k < j; k++)t.push_back(d[k]);
sort(t.begin(), t.end());
for (int k = 0; k < j - pt - len + 1; k++)v.push_back(t[k]);
}
pt = j + 1;
}
}
sort(v.begin(), v.end());
if (v.size() >= query)mini = min(mini, v[query - 1] - v[0]);
}
printf("%d\n", mini);
} |
#include<bits/stdc++.h>
using namespace std;
#define MN 2000
int n,k,q,a[MN+5],c[MN+5];
bool check(int l,int r)
{
int p=0,i,j,t,s=0;
for(i=1;i<=n+1;++i)if(a[i]<c[l])
{
for(t=0,j=p;++j<i;)if(a[j]<=c[r])++t;
s+=max(0,min(t,i-p-k));p=i;
}
return s>=q;
}
int main()
{
int i,j,ans=1e9;
scanf("%d%d%d",&n,&k,&q);
for(i=1;i<=n;++i)scanf("%d",&a[i]),c[i]=a[i];
sort(c+1,c+n+1);
for(i=j=1;i<=n;++i)
{
while(j<=n&&!check(i,j))++j;
if(j<=n)ans=min(ans,c[j]-c[i]);
}
printf("%d",ans);
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
inline int read(){
int x=0,f=1;char ch;
do{ch=getchar();if(ch=='-')f=-1;}while(ch<'0'||ch>'9');
do{x=x*10+ch-'0';ch=getchar();}while(ch>='0'&&ch<='9');
return x*f;
}
const int N=2010,INF=0x3f3f3f3f;
int a[N],b[N],tmp[N],lt,c[N],lc;
bool is[N];
int main(){
int n=read(),k=read(),q=read(),ans=INF;
for (int i=1;i<=n;++i) a[i]=b[i]=read();
sort(b+1,b+n+1);
is[n+1]=1;
for (int i=1;i<=n;++i){
for (int j=1;j<=n;++j) if (a[j]<b[i]) is[j]=1;
lt=lc=0;
for (int j=1;j<=n+1;++j){
if (is[j]){
if (lt>=k){
sort(tmp+1,tmp+lt+1);
for (int x=1;x<=lt-k+1;++x) c[++lc]=tmp[x];
}
lt=0;
}
else tmp[++lt]=a[j];
}
if (lc>=q){
sort(c+1,c+lc+1);
ans=min(ans,c[q]-b[i]);
}
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int ans = 1145141919;
int N, K, Q;
cin >> N >> K >> Q;
vector<int>A(N + 1, 0);
for(int i=0; i<N; i++)cin >> A[i];
for(int i=0; i<N; i++){
vector<int>tmp, tmp2;
for(int j=0; j<=N;j++){
if(A[j] < A[i]){
if(tmp2.size() >= K){
sort(tmp2.begin(), tmp2.end());
for(int k=0; k+K-1<tmp2.size(); k++){
tmp.push_back(tmp2[k]);
}
}
tmp2.clear();
}
else tmp2.push_back(A[j]);
}
if(tmp.size()<Q)continue;
sort(tmp.begin(), tmp.end());
ans = min(ans, abs(tmp[Q-1] - tmp[0]));
}
cout << ans << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n,k,Q;
cin>>n>>k>>Q;
int a[2000],b[2000];
for(int i=0;i<n;i++){
cin>>a[i];
b[i]=a[i];
}
sort(b,b+n);
int ans=b[Q-1]-b[0];
for(int m=0;m<n;m++){
priority_queue<int> q;
for(int i=0;i<n;i++){
if(a[i]<a[m]){
continue;
}
priority_queue<int> q2;
while(a[i]>=a[m]){
q2.push(-a[i]);
i++;
if(i==n)break;
}
while(q2.size()>k-1){
q.push(q2.top());
q2.pop();
}
}
if(q.size()<Q)continue;
int y=-q.top();
for(int i=0;i<Q-1;i++){
q.pop();
}
int x=-q.top();
ans=min(ans,x-y);
}
cout<<ans<<endl;
return 0;
}
|
#include <iostream>
#include <cmath>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
const int N=2100;
int A[N],w[N],n,K,Q;
int check(int l,int r){
int pre=1; int ans=0;
// cout<<"chek "<<l<<" "<<r<<endl;
for (int i=1;i<=n+1;i++){
if (i==n+1||A[i]<l){
if (i-pre>=K){
int num=0;
// cout<<pre<<" "<<i-1<<endl;
for (int j=pre;j<i;j++)
if (A[j]<=r) num++;
ans+=min(num,i-pre-K+1);
}
pre=i+1;
}
}
return ans>=Q;
}
int main(){
scanf("%d%d%d",&n,&K,&Q);
for (int i=1;i<=n;i++) scanf("%d",&A[i]),w[i]=A[i];
sort(w+1,w+n+1);
int r=1; int ans=2e9;
for (int i=1;i<=n;i++){
while (r<=n&&check(w[i],w[r])==0) r++;
//cout<<w[i]<<" "<<w[r]<<endl;
if (r>n) continue;
ans=min(ans,w[r]-w[i]);
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
int n,K,Q,a[2005],L,R,M;
int main(){
scanf("%d%d%d",&n,&K,&Q);
for (int i=1;i<=n;++i) scanf("%d",&a[i]);
L=0; R=1000000000;
while (L<R){
M=(L+R)/2;
int fl=0;
for (int i=1;i<=n;++i){
int p=a[i];
int k=0,tmp=0,s=0;
for (int j=1;j<=n+1;++j)
if (a[j]<p||j==n+1){
tmp+=j-k-1<K?0:min(j-k-1-K+1,j-k-1-s); k=j; s=0;
}else
if (a[j]>p+M) ++s;
if (tmp>=Q) {fl=1; break;}
}
if (fl) R=M; else L=M+1;
}
printf("%d\n",L);
} |
#include<cstdio>
#include<algorithm>
int n,K,Q,flag[200100],val[200100],A[200100],b[200100],ans=0x3f3f3f3f;
using std::sort;
struct node{
int val,id;
bool operator<(node b)const{
return val<b.val;
}
}a[200100];
int main(){
scanf("%d%d%d",&n,&K,&Q);
for(int i=1;i<=n;i++)
scanf("%d",&val[i]),a[i].val=val[i],a[i].id=i;
sort(a+1,a+n+1);
flag[0]=flag[n+1]=1;
for(int i=1;i<=n-Q+1;i++){
flag[a[i-1].id]=1;
int cnt=0;
for(int j=1,sum=0;j<=n+1;j++)
if(!flag[j])A[++sum]=val[j];
else{
if(sum==0)continue;
sort(A+1,A+sum+1);
for(int k=1;k<=sum-K+1;k++)
b[++cnt]=A[k];
sum=0;
}
if(cnt<Q)break;
sort(b+1,b+cnt+1);
ans=std::min(ans,b[Q]-b[1]);
}
printf("%d\n",ans);
} |
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxn 300005
#define ll long long
using namespace std;
int a[maxn];
int b[maxn];
int c[maxn];
int n, k, q;
int main()
{
scanf("%d%d%d", &n, &k, &q);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int ans = 1000000000;
for(int i = 1; i <= n; i++)
{ // y >= a[i] mns
int ncnt = 0;
for(int j = 1; j <= n; )
{
if(a[j] < a[i])
{
j++;
continue;
}
int npl = j;
while(npl <= n && a[npl] >= a[i])
npl++;
int tms = npl - j - k + 1;
for(int l = j; l < npl; l++)
b[l] = a[l];
sort(b + j, b + npl);
for(int l = j; l < j + tms; l++)
c[ncnt++] = b[l];
j = npl + 1;
}
if(ncnt < q) continue;
sort(c, c + ncnt);
ans = min(ans, c[q - 1] - a[i]);
}
printf("%d\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,k,q,a[2005],ans=(1ll<<30);
bool chk[2005];
ll solve(ll val){
for(ll i=1;i<=n;i++){
if(a[i]<val)chk[i]=1;
else chk[i]=0;
}
vector<ll> s,t;
for(ll i=1;i<=n+1;i++){
if(chk[i]||i==n+1){
sort(t.begin(),t.end());
if(t.size()>=k)for(ll j=0;j<t.size()-(k-1);j++)s.push_back(t[j]);
t.clear();
}
else t.push_back(a[i]);
}
sort(s.begin(),s.end());
if(s.size()<q)return (1ll<<30);
return s[q-1]-s[0];
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>k>>q;
for(ll i=1;i<=n;i++)cin>>a[i];
for(ll i=1;i<=n;i++)ans=min(ans,solve(a[i]));
cout<<ans;
} |
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#define N 2005
using namespace std;
int n, k, Q, ans = 9e9, cnt, s, a[N];
vector<int> b, c;
int main()
{
int i, j, w;
cin >> n >> k >> Q;
for (i = 1; i <= n; i++) scanf ("%d", &a[i]);
for (i = 1; i <= n; i++) {
s = 0;
cnt = 0;
b.clear();
c.clear();
for (j = 1; j <= n; j++) {
if (a[j] >= a[i]) {
cnt++;
b.push_back(a[j]);
} else {
if (cnt >= k) {
s += cnt - k + 1;
sort(b.begin(), b.end());
for (w = 0; w <= cnt - k; w++) c.push_back(b[w]);
}
cnt = 0;
b.clear();
}
}
if (cnt >= k) {
s += cnt - k + 1;
sort(b.begin(), b.end());
for (w = 0; w <= cnt - k; w++) c.push_back(b[w]);
b.clear();
}
cnt = 0;
if (s >=Q) {
sort(c.begin(),c.end());
ans = min(ans, c[Q - 1] - a[i]);
}
}
cout <<ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int ans = (int) 1e9 + 1;
for (int i = 0; i < n; i++) { /* lower bound */
vector<int> interval, ok;
for (int j = 0; j <= n; j++) {
if (j != n && a[j] >= a[i]) {
interval.emplace_back(a[j]);
}
else {
if ((int)interval.size() >= k) {
sort(interval.begin(), interval.end());
for (int ii = 0; ii < (int) interval.size() - k + 1; ii++) {
ok.emplace_back(interval[ii]);
}
}
interval.clear();
}
}
sort(ok.begin(), ok.end());
if ((int) ok.size() >= q) {
ans = min(ans, ok[q - 1] - a[i]);
}
}
cout << ans << "\n";
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
const int INF = 1e9;
const ld EPS = 1e-8;
int main(){
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
REP(i,N) cin >> A[i];
int ret = INF;
for(int bound: A) {
vector<int> tmp;
multiset<int> ms;
REP(i,N + 1) {
if(i == N || A[i] < bound) {
sort(ALL(tmp));
REP(j, tmp.size() - K + 1) ms.insert(tmp[j]);
tmp.clear();
}else{
tmp.push_back(A[i]);
}
}
if(ms.size() < Q) continue;
auto itr = ms.begin();
REP(i,Q - 1) itr++;
ret = min(ret, *itr - bound);
}
cout << ret << endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,k,q;
cin>>n>>k>>q;
vector<int> a(n);
vector<int> o(n);
for(int i=0;i<n;i++){
cin>>a.at(i);
o.at(i)=a.at(i);
}
a.push_back(0);
sort(o.begin(),o.end());
int m;
for(int x=0;x<n;x++){
vector<vector<int>> c(x+1);
for(int i=0,p=0;i<=n;i++){
if(a.at(i)==0){
sort(c.at(p).begin(),c.at(p).end());
p++;
}else
c.at(p).push_back(a.at(i));
}
vector<int> ch;
for(auto x:c)
for(int i=0;i<max((int)x.size()-k+1,0);i++)
ch.push_back(x.at(i));
if(ch.size()<q)
break;
sort(ch.begin(),ch.end());
m=(x==0?ch.at(q-1)-ch.at(0):min(m,ch.at(q-1)-ch.at(0)));
for(int i=0;i<n;i++){
if(a.at(i)==o.at(x)){
a.at(i)=0;
break;
}
}
}
cout<<m<<endl;
} |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; ++ i)
using namespace std;
const int N = 2e3 + 10;
int a[N], t[N], n, k, q, b[N];
int main() {
scanf("%d%d%d", &n, &k, &q);
For(i, 1, n) scanf("%d", a + i); a[++ n] = -1;
int ans = INT_MAX;
For(tt, 1, n) {
int nw = a[tt], c = 0, lstps = 1;
For(i, 1, n) if (a[i] < nw) {
if (i - lstps < k) { lstps = i + 1; continue; }
int cnt = 0;
For(j, lstps, i - 1) b[++ cnt] = a[j];
nth_element(b + 1, b + cnt - k + 1, b + cnt + 1);
For(j, 1, cnt - k + 1) t[++ c] = b[j];
lstps = i + 1;
}
if (c < q) continue;
nth_element(t + 1, t + q, t + c + 1);
ans = min(ans, t[q] - nw);
}
cout << ans << endl;
return 0;
}
|
#include <cstdio>
#include <algorithm>
#define max_n 2000
#define INF 2147483647
using namespace std;
int a[max_n+1],t[max_n+1],b[max_n+1],c[max_n+1];
template<typename T1,typename T2>void minify(T1&x,const T2&y){
y<x&&(x=y);
}
void cal(int mn,int n,int k,int q,int&ans){
int bcnt=0;
for(int l,r=1,cnt=0; r<=n; cnt=0){
for(l=r-1; a[++l]<mn&&l<=n; );
for(r=l-1; a[++r]>=mn&&r<=n; );
for(int i=l-1; ++i<r; c[++cnt]=a[i]);
if(cnt>=k){
nth_element(c+1,c+cnt-k+1,c+cnt+1);
for(int i=0; ++i<=cnt-k+1; b[++bcnt]=c[i]);
}
}
nth_element(b+1,b+q,b+bcnt+1);
bcnt>=q&&(minify(ans,b[q]-*min_element(b+1,b+q+1)),1);
}
int main(){
int n,k,q,ans=INF;
scanf("%d%d%d",&n,&k,&q);
for(int i=0; ++i<=n; t[i]=a[i])
scanf("%d",a+i);
stable_sort(t+1,t+n+1);
for(int i=0; ++i<=n; cal(t[i],n,k,q,ans));
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=2005;
int n,k,q,a[N],b[N];
int solve(int x)
{
vector<int>v;
vector<int>res;
for(int i=1;i<=n;i++)
if(a[i]>=x) v.push_back(a[i]);
else
{
sort(v.begin(),v.end());
for(int i=0;i+k<=v.size();i++)
res.push_back(v[i]);
v.clear();
}
sort(v.begin(),v.end());
for(int i=0;i+k<=v.size();i++)
res.push_back(v[i]);
v.clear();
sort(res.begin(),res.end());
if(res.size()<q) return 1e9;
return res[q-1]-res[0];
}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+1+n);
int tot=unique(b+1,b+1+n)-b-1;
int ans=1e9;
for(int i=1;i<=tot;i++)
ans=min(ans,solve(b[i]));
printf("%d\n",ans);
} |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
ll A[2000];
int main() {
int N, K, Q;
cin >> N >> K >> Q;
for (int i = 0; i < N; i++) cin >> A[i];
ll ans = INF;
for (int i = 0; i < N; i++) {
ll l = -1, r = INF;
while (r - l > 1) {
ll m = (l + r) / 2;
int cnt = 0;
int len = 0, a = 0, b = 0;
for (int j = 0; j < N; j++) {
if (A[j] < A[i]) {
cnt += min(max(len - K + 1, 0), a);
len = a = b = 0;
}
else {
len++;
if (A[j] <= A[i] + m) a++;
else b++;
}
}
cnt += min(max(len - K + 1, 0), a);
if (cnt >= Q) r = m;
else l = m;
}
ans = min(ans, r);
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int A[2005];
int main(){
ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
int n, k, q, ans = 2e9; cin >> n >> k >> q;
for(int i=0;i<n;i++) cin >> A[i];
A[n] = -1;
for(int i=0;i<n;i++){
vector<int> c, b;
for(int j=0;j<=n;j++){
if(A[j]<A[i]){
sort(b.begin(), b.end());
for(int l=0;l<(int)b.size()-k+1;l++) c.push_back(b[l]);
b.clear();
}
else b.push_back(A[j]);
}
if(c.size()<q) continue;
sort(c.begin(), c.end());
ans = min(ans, c[q-1]-c[0]);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n,K,Q,a[2005],w[2005],s[2005],temp[2005];
int main(){
scanf("%d%d%d",&n,&K,&Q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]),w[i]=a[i];
sort(w+1,w+n+1);
int ans=2e9;
for(int i=1;i<=n;i++){
int top=0;
for(int p=1,j;p<=n;){
if(a[p]<w[i]){
p++;continue;
}
for(j=p;a[j]>=w[i]&&j<=n;j++) temp[j-p+1]=a[j];
sort(temp+1,temp+j-p+1);
for(int k=1;k<=j-p-K+1;k++) s[++top]=temp[k];
p=j;
}
sort(s+1,s+top+1);
if(top>=Q) ans=min(ans,s[Q]-s[1]);
}
printf("%d",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int n, k, q;
int a[2000];
int sub(int t) {
vector<vector<int>> vs;
vector<int> v;
for (int i = 0; i < n; ++i) {
if (a[i] < t) {
vs.push_back(v);
v.clear();
} else {
v.push_back(a[i]);
}
}
if (!v.empty()) {
vs.push_back(v);
}
vector<int> r;
for (auto&& v : vs) {
if (v.size() < k) continue;
sort(v.begin(), v.end());
int len = v.size() - k + 1;
for (int i = 0; i < len; ++i) {
r.push_back(v[i]);
}
}
sort(r.begin(), r.end());
if (r.size() < q) return 2e9;
return r[q - 1] - t;
}
int main() {
cin >> n >> k >> q;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
int mn = 2e9;
for (int i = 0; i < n; ++i) {
int tmp = sub(a[i]);
mn = min(mn, tmp);
}
cout << mn << endl;
} |
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int n,k,q;
int main()
{
cin>>n>>k>>q;
vector<int>a(n);
for(int i=0;i<n;i++)
{
cin>>a[i];
}
int ans=1e9;
vector<int>b;
b.push_back(n);
while(1)
{
int f=0;
int mina=2e9,mini=-1;
vector<int>now;
for(int i=0;i<b.size();i++)
{
vector<pair<int,int> >tmp;
for(int j=f;j<b[i];j++)
{
tmp.push_back(make_pair(a[j],j));
}
sort(tmp.begin(),tmp.end());
for(int j=0;b[i]-f-j>=k;j++)
{
now.push_back(tmp[j].first);
}
if(!tmp.empty()&&tmp[0].first<mina)
{
mina=tmp[0].first;
mini=tmp[0].second;
}
f=b[i]+1;
}
if(now.size()<q)break;
sort(now.begin(),now.end());
ans=min(ans,now[q-1]-now[0]);
b.push_back(mini);
sort(b.begin(),b.end());
}
cout<<ans<<endl;
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a) for(int i=0;i<(a);i++)
const ll MOD=1000000007;
int N,K,Q;
ll A[2020];
const ll INF=LLONG_MAX/2;
int main(){
cin>>N>>K>>Q;
rep(i,N) cin>>A[i];
ll ans=INF;
rep(i,N){
int l=0;
vector<ll> v,tmp;
rep(j,N){
if(A[j]<A[i]){
if(tmp.size()>=K){
sort(tmp.begin(),tmp.end());
rep(k,tmp.size()-K+1) v.push_back(tmp[k]);
}
tmp.clear();
}else{
tmp.push_back(A[j]);
}
}
if(tmp.size()>=K){
sort(tmp.begin(),tmp.end());
rep(k,tmp.size()-K+1) v.push_back(tmp[k]);
}
sort(v.begin(),v.end());
if(v.size()<Q) continue;
else ans=min(ans,v[Q-1]-v[0]);
}
cout<<ans<<endl;
return 0;
}
|
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef complex<double> com;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const int inf = 2e9;
int main() {
int n, k, q; cin >> n >> k >> q;
vector<int> a(n+1);
rep(i, 0, n) cin >> a[i];
a[n] = -1; int ans = inf;
rep(i, 0, n) {
vector<int> b, c;
rep(j, 0, n+1) {
if (a[j] < a[i]) {
sort(b.begin(), b.end());
rep(l, 0, (int)b.size() - k + 1) c.push_back(b[l]);
b = {};
}
else b.push_back(a[j]);
}
if (c.size() < q) continue;
sort(c.begin(), c.end());
ans = min(ans, c[q - 1] - c[0]);
}
printf("%d", ans);
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
cin.tie(0);
ios::sync_with_stdio(false);
int n,k,q; cin >> n >> k >> q;
vector<int> a(n);
for(int i = 0; i < n; i++){
cin >> a[i];
}
int ans = 1 << 30;
for(int i = 0; i < n; i++){
vector<int> v;
for(int j = 0; j < n; j++){
vector<int> t;
while(j < n && a[i] <= a[j]){
t.push_back(a[j]);
j++;
}
sort(t.begin(),t.end());
for(int l = 0; l < max(0LL,(int)t.size()-k+1); l++){
v.push_back(t[l]);
}
}
if(v.size() < q) continue;
sort(v.begin(),v.end());
ans = min(ans,v[q-1] - v[0]);
}
cout << ans << endl;
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
static const int MAX_N = 2000;
static const int MAX_A = 1000000000;
int N, K, Q;
int A[MAX_N];
int main(){
cin >> N >> K >> Q;
for(int i = 0; i < N; i++) cin >> A[i];
int ans = MAX_A + 1;
for(int i = 0; i < N; i++){
int Y = A[i];
int cnt = 0;
vector<int> va, vb;
for(int j = 0; j < N; j++){
if(A[j] >= A[i] && j != N - 1){
va.push_back(A[j]);
}else{
if(A[j] >= A[i] && j == N - 1) va.push_back(A[j]);
if(va.size() < K){
va.clear();
continue;
}
sort(va.begin(), va.end());
for(int l = 0; l < va.size() - K + 1; l++){
vb.push_back(va[l]);
}
va.clear();
}
}
sort(vb.begin(), vb.end());
if(vb.size() >= Q) ans = min(ans, vb[Q - 1] - Y);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long int ll;
#define INF 1 << 30
#define REP(i,n) for(ll i=0; i<(int)(n); i++)
#define FOR(i,k,n) for(ll i=(k);i<(int)(n);i++)
int n,k,q;
vector<int> a;
int ans = INT_MAX;
int main(){
cin >> n>> k>> q;
REP(i,n){
int t;
cin >> t;
a.push_back(t);
}
REP(i,n){
vector<int> mi;
vector<int> tmp;
REP(r,n+1){
if(r < n && a[r]>=a[i]) tmp.push_back(a[r]);
if(r == n || a[r]<a[i]){
sort(tmp.begin(),tmp.end(),greater<int>());
while(tmp.size()>=k){
mi.push_back(tmp.back());
tmp.pop_back();
}
tmp.clear();
continue;
}
}
if(mi.size()<q) continue;
sort(mi.begin(),mi.end());
ans = min(ans,mi[q-1]-mi[0]);
}
cout << ans <<endl;
}
|
#include<bits/stdc++.h>
#define N 2005
#define inf 1000000000
using namespace std;
int i,j,k,l,s,n,m,v[N],a[N],q[N],id[N],ans;
inline bool cmp(int x,int y) {
return a[x]<a[y];
}
inline void work(int l,int r) {
if (l>r) return ;
int s=0;
for (int i=l;i<=r;i++) q[++s]=i;
sort(q+1,q+1+s,cmp);
for (int i=1;i<=s-k+1;i++) v[q[i]]=1;
}
int main() {
scanf("%d%d%d",&n,&k,&m);
for (i=1;i<=n;i++) scanf("%d",&a[i]),id[i]=i;
sort(id+1,id+1+n,cmp);
ans=inf;
for (i=1;i<=n;i++) {
int L=0;
for (j=1;j<=n;j++) v[j]=0;
for (j=1;j<=n;j++)
if (a[j]<a[i]) work(L+1,j-1),L=j;
work(L+1,n);
s=0;
for (j=1;j<=n;j++) {
if (v[id[j]]) s++;
if (s==m) break;
}
if (j<=n) ans=min(ans,a[id[j]]-a[i]);
}
printf("%d\n",ans);
} |
#include <bits/stdc++.h>
using namespace std;
using int64 = long long;
const int INF = 1 << 30;
int main() {
int N, K, Q, A[2000];
cin >> N >> K >> Q;
for(int i = 0; i < N; i++) {
cin >> A[i];
}
int ret = INF;
for(int i = 0; i < N; i++) {
int low = A[i];
vector< vector< int > > ok;
ok.emplace_back(vector< int >());
for(int j = 0; j < N; j++) {
if(A[j] < low) {
ok.emplace_back(vector< int >());
} else {
ok.back().emplace_back(A[j]);
}
}
vector< int > ans;
for(auto &vs : ok) {
sort(begin(vs), end(vs));
reverse(begin(vs), end(vs));
while(vs.size() >= K) {
ans.emplace_back(vs.back());
vs.pop_back();
}
}
sort(begin(ans), end(ans));
if(ans.size() >= Q) ret = min(ret, ans[Q - 1] - low);
}
cout << ret << endl;
} |
#include "bits/stdc++.h"
using namespace std;
int n, k, q;
int a[2005];
int b[2005];
bool good(int x, int y) {
int l = 0;
int ans = 0;
while(l < n) {
int r = l;
int cnt = 0;
while(r < n && a[r] >= x) {
cnt += (a[r] <= y);
++r;
}
ans += max(0, min(r - l - k + 1, cnt));
l = r + 1;
}
return ans >= q;
}
int main(int argc, char const *argv[])
{
scanf("%d %d %d", &n, &k, &q);
for(int i = 0; i < n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
sort(b, b + n);
int ans = b[n - 1] - b[0];
for(int i = 0; i < n; i++) {
int l = i, r = n - 1;
while(l < r) {
int m = (l + r) >> 1;
if(good(b[i], b[m])) {
r = m;
} else {
l = m + 1;
}
}
if(good(b[i], b[l])) {
ans = min(ans, b[l] - b[i]);
}
}
printf("%d\n", ans);
return 0;
} |
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int n, k, q, mn=1e9, a[2005];
vector<int> t, z;
int main() {
int i, j, x, y;
cin>>n>>k>>q;
for(i=0; i<n; i++) cin>>a[i];
for(i=0; i<n; i++) {
z.clear();
for(x=0; x<n; x=y+1) {
for(y=x; y<n && a[y]>=a[i]; y++);
if(y-x<k) continue;
t.clear();
for(j=x; j<y; j++) t.push_back(a[j]);
sort(t.begin(), t.end());
for(j=0; j<=t.size()-k; j++) z.push_back(t[j]);
}
if(z.size()<q) continue;
sort(z.begin(), z.end());
mn = min(mn, z[q-1] - z[0]);
}
cout<<mn;
return 0;
} |
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#define LL long long
using namespace std;
const int maxn = 2020;
int a[maxn],x[maxn],y[maxn],z[maxn];
int main(void) {
// freopen("e.in","r",stdin);
int n,k,q; scanf("%d%d%d",&n,&k,&q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),x[i-1]=a[i];
sort(x,x+n);
int tot=unique(x,x+n)-x;
int ans=1e9;
for (int i=0;i<tot;i++) {
int zz=0;
for (int j=1,l=0;j<=n+1;j++) {
if (j==n+1 || a[j]<x[i]) {
sort(y,y+l);
for (int u=0;u<l-k+1;u++) z[zz++]=y[u];
l=0;
} else y[l++]=a[j];
}
if (zz<q) continue;
sort(z,z+zz);
ans = min(ans, z[q-1]-z[0]);
}
printf("%d\n",ans);
return 0;
}
|
#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<queue>
#define re register
#define rep(i,s,t) for(re int i=s;i<=t;++i)
using namespace std;
const int N=1e6+11;
int n,k,q,cnt,ans;
int a[N],b[N],c[N],bl[N],sz[N],id[N];
inline bool cmp(int x,int y){
return a[x]<a[y];
}
inline void build(){
cnt=1;
rep(i,1,n)
sz[i]=0;
rep(i,1,n)
if(c[i])
++cnt;
else{
bl[i]=cnt;
++sz[cnt];
}
}
int main(){
scanf("%d%d%d",&n,&k,&q);
rep(i,1,n)
scanf("%d",a+i),id[i]=i;
ans=1e9+1;
sort(id+1,id+n+1,cmp);
rep(i,1,n){
build();
int top=i,j;
for(j=1;j<=q;++j){
while(top<=n&&sz[bl[id[top]]]<k)
++top;
if(top>n)break;
--sz[bl[id[top]]];
++top;
}
--top;
//printf("%d %d %d\n",top,a[id[top]],a[id[i]]);
if(j==q+1&&top<=n){
ans=min(ans,a[id[top]]-a[id[i]]);
}
c[id[i]]=1;
}
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int A[2002];
int N, K, Q;
scanf("%d %d %d", &N, &K, &Q);
A[0] = A[N + 1] = 0;
for (int i = 1; i <= N; i++) {
scanf("%d", A + i);
}
int ans = 1000000000;
for (int i = 1; i <= N; i++) {
priority_queue<int, vector<int>, greater<int>> pq;
priority_queue<int, vector<int>, greater<int>> pq2;
for (int j = 0; j <= N + 1; j++) {
if (A[j] < A[i]) {
while (pq.size() >= K) {
pq2.push(pq.top());
pq.pop();
}
pq = decltype(pq)();
}
else {
pq.push(A[j]);
}
}
if (pq2.size() >= Q) {
for (int j = 0; j < Q - 1; j++) {
pq2.pop();
}
ans = min(ans, pq2.top() - A[i]);
}
}
printf("%d\n", ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
template<typename T>
void out(T x) { cout << x << endl; exit(0); }
#define watch(x) cout << (#x) << " is " << (x) << endl
typedef long long ll;
const ll mod = 1e9+7;
const int maxn = 1e6 + 5;
int n,k,q;
int ans=2e9;
vector<int> a;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
cin>>n>>k>>q;
a.resize(n);
for (int i=0; i<n; i++) {
cin>>a[i];
}
for (int x: a) {
multiset<int> s;
vector<int> v;
for (int i=0; i<=n; i++) {
if (i==n||a[i]<x) {
sort(v.rbegin(), v.rend());
while ((int)v.size() >= k) {
s.insert(v.back());
v.pop_back();
}
v.clear();
} else {
v.push_back(a[i]);
}
}
if ((int)s.size()<q) continue;
auto iter=s.begin();
for (int j=0; j<q-1; j++) iter++;
ans=min(ans,*iter-x);
}
cout<<ans<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
const int N=2e3+10;
int n,k,q;
int a[N],c[N];
pair<int,int> sor[N];
void movit(int l,int r){
memset(c,0,sizeof(c));
for(int i=l;i<=r;i++)
c[sor[i].second]=1;
for(int i=r+1;i<=n;i++)
c[sor[i].second]=2;
}
bool judge(){
int ans=0,len=0,h=0;
for(int i=1;i<=n+1;i++)
if(c[i]) len++,h+=2-c[i];
else{
ans+= len>=k ? min(len-k+1,h):0;
len=0,h=0;
}
return ans>=q;
}
int main()
{
scanf("%d%d%d",&n,&k,&q);
for(int temp,i=1;i<=n;i++){
scanf("%d",&a[i]);sor[i]=make_pair(a[i],i);
}
sort(sor+1,sor+n+1);
int ans=1e9+10;
for(int i=1;i<=n;i++){
int l=i,r=n+1;
while(l<r){
int mid=(l+r)>>1;
movit(i,mid);
if(judge()) r=mid;
else l=mid+1;
}
if(l>n) continue;
ans=min(ans,sor[l].first-sor[i].first);
}
cout<<ans;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int arr[2009];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,k,q;
cin>>n>>k>>q;
vector<int> v;
for(int i=0;i<n;i++){
cin>>arr[i];
v.push_back(arr[i]);
}
sort(v.begin(),v.end());
int ans = INT_MAX;
for(int i=0;i<n;i++){
vector<int> val;
vector<int> res;
for(int j=0;j<n;j++){
if(arr[j]>=v[i]){val.push_back(arr[j]);}
else{
sort(val.begin(),val.end());
int len = (int)val.size();
for(int a=0;a<len-k+1;a++){res.push_back(val[a]);}
val.clear();
}
}
sort(val.begin(),val.end());
int len = (int)val.size();
for(int a=0;a<len-k+1;a++){res.push_back(val[a]);}
if((int)res.size() >= q){
sort(res.begin(),res.end());
ans = min(ans,(res[q-1]-v[i]));
}
}
cout<<ans<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1LL<<61;
int main() {
ll n,k,Q;
cin >> n >> k >> Q;
vec a(n);
vector<pll> b(n);
vec al(n);
for(ll i=0;i<n;i++) {
cin >> a[i];
b[i]={a[i],i};
}
sort(b.begin(),b.end());
ll ans=inf;
for(ll i=0;i<n;i++) {
ll id=b[i].second;
priority_queue<ll,vec,greater<ll>> q;
vec c;
for(ll j=0;j<n;j++) {
if(al[j]) {
while(q.size()) q.pop();
}
else {
q.push(a[j]);
if(q.size()==k) {
c.push_back(q.top());
q.pop();
}
}
}
al[id]=1;
if(c.size()<Q) break;
sort(c.begin(),c.end());
ans=min(ans,c[Q-1]-c[0]);
}
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1000000010;
int main(){
cin.tie(0);
ios_base::sync_with_stdio(0);
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
for(int i=0;i<N;i++) cin >> A[i];
int ans = INF;
for(int i=0;i<N;i++){
int l = 0, r = 0;
vector<int> vec;
while(l < N){
priority_queue<int, vector<int>, greater<int> > que;
while(r < N && A[i] <= A[r]){
que.push(A[r]);
++r;
}
while((int)que.size() >= K){
vec.push_back(que.top());
que.pop();
}
++r;
l = r;
}
if((int)vec.size() < Q) continue;
sort(vec.begin(), vec.end());
ans = min(ans, vec[Q-1] - vec[0]);
}
cout << ans << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int M=2e3+5;
int que[M],order[M],tmp[M],now[M],tot,top,n,k,q;
void in()
{
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;++i)scanf("%d",&que[i]),order[i]=que[i];
}
void add(int le,int ri)
{
tot=0;
// printf("%d %d\n",le,ri);
if(le>ri||ri-le+1<k)return;
// printf("%d %d\n",le,ri);
for(int i=le;i<=ri;++i)tmp[++tot]=que[i];
sort(tmp+1,tmp+1+tot);
for(int i=ri-le+2-k;i>=1;--i)now[++top]=tmp[i];
}
int test(int mn)
{
// printf("test:%d\n",mn);
int p=1;top=0;
for(int i=1;i<=n;++i)if(que[i]<mn)add(p,i-1),p=i+1;
if(top<q)return INT_MAX;
sort(now+1,now+1+top);
return now[q]-mn;
}
void ac()
{
int ans=INT_MAX;
sort(order+1,order+1+n);que[++n]=-INT_MAX;
for(int i=1;i<n;++i)ans=min(test(order[i]),ans);
printf("%d",ans);
}
int main()
{
in();ac();
return 0;
} |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N,K,Q;
int A[2010];
int main(){
cin >> N >> K >> Q;
vector<int> v(N);
for(int i=0;i<N;i++){
cin >> A[i];
v[i] = A[i];
}
sort(v.begin(),v.end());
int ans = 2e9;
vector<int> removed,pre_removed;
for(int i=0;i<N;i++){
int c = 0;
for(int j=0;j<=N;j++){
if(j!=N && A[j]>=v[i]){
pre_removed.push_back(A[j]);
c++;
}else if(j==N || A[j]<v[i]){
if(c>=K){
sort(pre_removed.begin(),pre_removed.end());
for(int k=0;k<=c-K;k++){
removed.push_back(pre_removed[k]);
}
}
pre_removed.clear();
c = 0;
}
}
if(removed.size()>=Q){
sort(removed.begin(),removed.end());
ans = min(ans,removed[Q-1]-removed[0]);
}
removed.clear();
}
cout << ans << endl;
} |
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <math.h>
#include <vector>
#include <queue>
using namespace std;
const int MAXN = 2000 + 10;
int N, M, Q;
int A[MAXN];
int l, r, mid;
int main() {
register int i, j;
scanf( "%d%d%d", &N, &M, &Q );
for( i = 1; i <= N; ++i ) scanf( "%d", A + i );
l = 0, r = 2000000000;
while(l < r) {
int mid = (l + r) >> 1; bool ok = 0;
for( i = 1; i <= N; ++i ) {
int p = A[i];
int k = 0, tmp = 0, cnt = 0;
for(j = 1; j <= N + 1; ++j)
if(A[j] < p || j == N + 1)
tmp += j - k - 1 < M ? 0 : min(j - k - 1 - M + 1, j - k - 1 - cnt), k = j, cnt = 0;
else
if(A[j] > p + mid) ++cnt;
if(tmp >= Q) {
ok = 1;
break;
}
}
ok ? r = mid : l = mid + 1;
}
printf( "%d\n", l );
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2e3+10;
int n,k,q,x[maxn],ans=2e9;
bool vis[maxn];
pair<int,int> a[maxn];
inline int chk(){
vector<int> vec;
for(int i=1;i<=n;){
while(i<=n&&vis[i])
++i;
vector<int> tmp;
while(i<=n&&!vis[i]){
tmp.push_back(x[i]);
++i;
}
sort(tmp.begin(),tmp.end());
for(int j=0;j+k-1<tmp.size();++j)
vec.push_back(tmp[j]);
}
sort(vec.begin(),vec.end());
return vec.size()>=q?vec[q-1]:2e9;
}
int main(){
cin>>n>>k>>q;
for(int i=1;i<=n;++i){
cin>>x[i];
a[i]=make_pair(x[i],i);
}
sort(a+1,a+n+1);
ans=min(ans,chk()-a[1].first);
for(int i=1;i<n;++i){
vis[a[i].second]=true;
ans=min(ans,chk()-a[i+1].first);
}
cout<<ans<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
const int N=2005;
const int inf=0x3f3f3f3f;
int l,top,n,k,Q,a[N],b[N],ans,q[N];
vector<int> vec;
int solve(int x)
{
l=1;vec.clear();
for (int i=1;i<=n+1;i++)
if (a[i]<x)
{
if (i-l>=k)
{
top=0;
for (int j=l;j<i;j++) q[++top]=a[j];
sort(q+1,q+top+1);
for (int j=1;j<=i-l-k+1;j++) vec.push_back(q[j]);
}
l=i+1;
}
sort(vec.begin(),vec.end());
if (Q-1>=vec.size()) return inf;
return vec[Q-1]-x;
}
int main()
{
scanf("%d%d%d",&n,&k,&Q);
for (int i=1;i<=n;i++) scanf("%d",&a[i]),b[i]=a[i];
sort(b+1,b+n+1);ans=inf;
for (int i=1;i<=n;i++) ans=min(ans,solve(b[i]));
printf("%d\n",ans);
return 0;
} |
#include<bits/stdc++.h>
#define reg register
typedef long long ll;
using namespace std;
const int MN=2005;
int n,m,q,a[MN],b[MN],c[MN],t[MN],top;
inline void ins(int l,int r){
reg int tot=0;
for(reg int i=l;i<=r;i++)t[++tot]=a[i];
sort(t+1,t+1+tot);
for(reg int i=1;i<=r-l+2-m;i++)c[++top]=t[i];
}
inline int calc(int x){
reg int pre=1;top=0;
for(reg int i=1;i<=n;i++)
if(a[i]<x)ins(pre,i-1),pre=i+1;
if(top<q)return 0x3f3f3f3f;
sort(c+1,c+1+top);
return c[q]-x;
}
int main(){
scanf("%d%d%d",&n,&m,&q);
for(reg int i=1;i<=n;i++)
scanf("%d",a+i),b[i]=a[i];
sort(b+1,b+1+n);
reg int N=unique(b+1,b+1+n)-b-1,ans=0x3f3f3f3f;
a[++n]=-0x3f3f3f3f;
for(reg int i=1;i<=N;i++)ans=min(ans,calc(b[i]));
printf("%d\n",ans);
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for (int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
#define f first
#define s second
#define pb push_back
int n, k, q, A[2005], ans = 1e9+100;
int check(int g) {
vector<int> v, vv;
v.clear(); vv.clear();
int pre = 0;
FOR(i, 1, n+1) {
if (A[i] >= g) vv.pb(A[i]);
else {
sort(vv.begin(), vv.end(), greater<int>());
FOR(j, 1, i-pre-k) {v.pb(vv.back()); vv.pop_back();}
vv.clear();
pre = i;
}
}
sort(v.begin(), v.end());
if (v.size() < q) return 1e9+100;
else return (v[q-1] - g);
}
int main() {
cin >> n >> k >> q;
FOR(i, 1, n) cin >> A[i];
A[n+1] = -1;
FOR(i, 1, n) ans = min(ans, check(A[i]));
cout << ans;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int N,K,Q;
int A[100010];
int main(){
cin >> N >> K >> Q;
vector<int> v(N);
for(int i=0;i<N;i++){
cin >> A[i];
v[i] = A[i];
}
sort(v.begin(),v.end());
int ans = v[Q-1]-v[0];
for(int i=0;i<N;i++){
vector<int> removed,pre_removed;
int c = 0;
for(int j=0;j<=N;j++){
if(j!=N && A[j]>v[i]){
pre_removed.push_back(A[j]);
c++;
}else{
if(c>=K){
sort(pre_removed.begin(),pre_removed.end());
for(int k=0;k<=c-K;k++){
removed.push_back(pre_removed[k]);
}
}
pre_removed.clear();
c = 0;
}
}
if(removed.size()>=Q){
sort(removed.begin(),removed.end());
ans = min(ans,removed[Q-1]-removed[0]);
}
removed.clear();
}
cout << ans << endl;
}
|
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 1e9;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
int a[2002], sa[2002];
for(int i = 0; i < N; i++){
cin >> a[i];
sa[i] = a[i];
}
sort(sa, sa + N);
int ans = INF;
for(int l = 0; l < N - Q + 1; l++){
int r = Q + l;
int safelen = 0, ct = 0, canremovect = 0;
for(int i = 0; i < N; i++){
if(a[i] < sa[l]){
if(safelen >= K) ct += min(safelen - K + 1, canremovect);
canremovect = 0;
safelen = 0;
}
else if(a[i] > sa[r-1]) safelen++;
else{
safelen++;
canremovect++;
}
}
if(safelen >= K) ct += min(safelen - K + 1, canremovect);
if(ct >= Q) ans = min(ans, sa[r - 1] - sa[l]);
}
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<ll> A(N);
for (int i = 0; i < N; ++i) { cin >> A[i]; }
ll res = 1e18;
for (int i = 0; i < N; ++i) {
vector<ll> use;
int l = -1, r = 0;
while (r < N) {
while ((r < N) && (A[r] >= A[i])) { ++r; }
int len = r - l - 1;
vector<ll> tmp(len);
if (len >= K) {
for (int j = l + 1; j < r; ++j) {
tmp[j - l - 1] = A[j];
}
sort(tmp.begin(), tmp.end());
for (int j = 0; j < (len - K + 1); ++j) {
use.push_back(tmp[j]);
}
}
l = r;
++r;
}
if (use.size() >= Q) {
sort(use.begin(), use.end());
ll tmp = use[Q - 1] - use[0];
res = min(res, tmp);
}
}
cout << res << endl;
return 0;
}
|
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
static const ll INF = 1000000000000000000ll;
int main(){
ios_base::sync_with_stdio(false);
int n, k, q;
cin >> n >> k >> q;
vector<ll> a(n);
for(int i = 0; i < n; ++i){ cin >> a[i]; }
ll answer = INF;
for(int i = 0; i < n; ++i){
vector<vector<ll>> b;
b.emplace_back();
for(int j = 0; j < n; ++j){
if(a[j] >= a[i]){
b.back().push_back(a[j]);
}else if(!b.back().empty()){
b.emplace_back();
}
}
if(b.back().empty()){
b.pop_back();
}
vector<ll> c;
for(auto& v : b){
const int m = v.size();
sort(v.begin(), v.end());
for(int j = 0; j + k <= m; ++j){
c.push_back(v[j]);
}
}
sort(c.begin(), c.end());
if(c.size() >= q){
answer = min(answer, c[q - 1] - c[0]);
}
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;
const int INF = 1e9;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N + 2);
rep(i, N) cin >> A[i + 1];
int ans = INF;
auto solve = [&](int x) -> int {
priority_queue<int> que;
vector<int> P;
rep(i, N + 2) if(A[i] < x) P.push_back(i);
rep(i, P.size() - 1) {
priority_queue<int, vector<int>, greater<int>> tmp;
for(int j = P[i] + 1; j < P[i + 1]; ++j) tmp.push(A[j]);
while(tmp.size() >= K) que.push(tmp.top()), tmp.pop();
}
int mx = 0;
if(que.size() < Q) return INF;
while(que.size() > Q) que.pop();
return que.top() - x;
};
for(int i = 1; i < N + 1; ++i) ans = min(ans, solve(A[i]));
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k, q;
cin >> n >> k >> q;
vector<int> a(n);
for (int i = 0; i < n; i++) cin >> a.at(i);
int ans = 2e9;
for (int i = 0; i < n; i++) {
int now = a.at(i), it = 0;
vector<vector<int>> G(n);
for (int j = 0; j < n; j++) {
if (a.at(j) >= now) G[it].emplace_back(a.at(j));
else if (G[it].size() != 0) it++;
}
vector<int> keep;
for (int j = 0; j <= it; j++) {
sort(G[j].begin(), G[j].end());
for (int ii = 0; ii + k <= G[j].size(); ii++) {
keep.emplace_back(G[j][ii]);
}
}
sort(keep.begin(), keep.end());
if (keep.size() >= q) ans = min(ans, keep[q - 1] - keep[0]);
}
cout << ans << '\n';
} |
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef pair < int , int > pp;
const int mod = 1e9 + 7;
const int N = 2e3 + 3;
int A[N],B[N],n,k,q,i,j,ans;
int f(int b, int e){
int i,las,t,x;
las = t = x = 0;
for(i=1;i<=n+1;i++){
if(A[i] < b) { x += max(0, min(t , i-las-k)); las = i; t = 0; }
else if(A[i] <= e) t++;
}
return x;
}
int main(){
cin >> n >> k >> q;
for(i=1;i<=n;i++) { cin >> A[i]; B[i] = A[i]; }
sort(B+1 , B+n+1);
ans = mod;
for(i=q,j=1; i<=n; i++){
for(; j <= i && f(B[j],B[i]) >= q ; j++)
ans = min(ans , B[i]-B[j]);
}
if(ans == mod) assert(0);
cout << ans << endl;
return 0;
} |
#include <bits/stdc++.h>
#define For(i, j, k) for (int i = j; i <= k; i++)
using namespace std;
const int N = 2010;
int A[N], rk[N];
int n, k, q;
bool cmp(int x, int y) {
return A[x] < A[y];
}
int bel[N], cnt[N];
int main() {
scanf("%d%d%d", &n, &k, &q);
For(i, 1, n) scanf("%d", &A[i]), rk[i] = i;
sort(rk + 1, rk + n + 1, cmp);
int ans = 1e9;
For(i, 1, n - q + 1) {
For(j, 0, n) cnt[j] = 0;
For(j, 0, n) {
bel[j] = A[j] < A[rk[i]] ? j : bel[j - 1];
if (bel[j] != j) ++cnt[bel[j]];
}
int ret = 0;
For(j, i, n)
if (cnt[bel[rk[j]]] >= k) {
++ret, --cnt[bel[rk[j]]];
if (ret >= q) {
ans = min(ans, A[rk[j]] - A[rk[i]]);
break;
}
}
}
printf("%d\n", ans);
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1e9+7;
const int INF=1e9;
const ll LINF=1e18;
int main(){
int n,k,q;
cin>>n>>k>>q;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=2e9;
for(int i=0;i<n;i++){
vector<int> vv;
int mn=a[i];
for(int j=0;j<n;j++){
vector<int> v;
while(j<n&&mn<=a[j]){
v.push_back(a[j]);
j++;
}
if(v.size()>=k){
sort(v.begin(),v.end());
for(int l=0;l<(int)v.size()+1-k;l++){
vv.push_back(v[l]);
}
}
}
if(vv.size()>=q){
sort(vv.begin(),vv.end());
ans=min(ans,vv[q-1]-mn);
}
}
cout<<ans<<endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K, Q;
cin >> N >> K >> Q;
vector<int> A(N);
set<int> B;
for (auto& x : A) {
cin >> x;
B.insert(x);
}
int r = 1<<30;
for (int x : B) {
vector<vector<int>> aa;
int c = 0;
for (int i = 0; i < N; ++ i) {
if (A[i] >= x) {
++ c;
if (c == K) {
aa.push_back(vector<int>());
for (int j = i-c+1; j <= i; ++ j) aa.back().push_back(A[j]);
} else if (c > K) {
aa.back().push_back(A[i]);
}
} else {
c = 0;
}
}
vector<int> b;
for (auto& a : aa) {
sort(a.begin(), a.end());
for (int i = 0; i+K <= (int)a.size(); ++ i) b.push_back(a[i]);
}
if (Q > (int)b.size()) break;
sort(b.begin(), b.end());
r = min(r, b[Q-1] - b[0]);
}
cout << r << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k, q;
int a[2010];
#define rep(i,n) for(int i=0;i<(n);i++)
int main(int argc, char const *argv[])
{
cin >> n >> k >> q;
rep(i, n) cin >> a[i];
int ans = 1e9;
rep(l, n) {
// printf("l %d\n", l);
vector<int> v[2010];
int idx = 0;
rep(i, n) {
if (a[i] < a[l]) {
idx++;
continue;
}
v[idx].push_back(a[i]);
}
rep(i, 2010) sort(v[i].begin(), v[i].end());
vector<int> u;
rep(i, 2010) {
// printf("i %d\n", i);
if ((int)v[i].size() < k) continue;
// printf("size %d\n", (int)v[i].size());
rep(j, v[i].size() - k + 1) {
u.push_back(v[i][j]);
}
}
sort(u.begin(), u.end());
if (u.size() < q) continue;
ans = min(ans, u[q - 1] - u[0]);
}
printf("%d\n", ans);
return 0;
} |
#define FILEIO(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout);
#include <stdio.h>
#include <queue>
#include <algorithm>
#define N 10005
using namespace std;
int n,k,q,a[N],b[N],c[N];
inline void smin(int &a,int b){b<a?a=b:0;}
inline int read() {
char c=getchar();int x=0;
while(c<48||c>57) c=getchar();
while(c>47&&c<58) x=(x<<3)+(x<<1)+(c^48),c=getchar();
return x;
}
int solve(int x) {
int i,j,ans,m,t,p;
ans=0;m=0;
for(i=0;i<n;++i) {
for(j=i;j<n&&a[j]>=x;++j);
if(j-i>=k) {
p=j-i-k;
for(t=0;i<j;) b[t++]=a[i++];
sort(b,b+t);
while(~p) c[m++]=b[p--];
}
}
if(m<q) return 1<<30;
sort(c,c+m);
return c[q-1]-x;
}
int main() {
// FILEIO("operation");
int i,ans=1<<30;
n=read();k=read();q=read();
for(i=0;i<n;++i) a[i]=read();
for(i=0;i<n;++i) smin(ans,solve(a[i]));
printf("%d",ans);
return 0;
} |
#include<cstdio>
#include<algorithm>
int n,k,q,mi;
int a[2010],b[2010],ans[2001],cn,Ans=2147483647;
int main(){
scanf("%d%d%d",&n,&k,&q);
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
for(int i=1;i<=n;i++){
mi=a[i];
int l=1,r=1;
while(l<=n){
while(a[l]<mi&&l<n) l++;
r=l;
while(a[r+1]>=mi&&r<n) r++;
if(r-l+1>=k){
for(int j=l;j<=r;j++) b[j]=a[j];
std::sort(b+l,b+r+1);
for(int j=l;j<=r-k+1;j++) ans[++cn]=b[j];
}
l=r+1;
}
std::sort(ans+1,ans+cn+1);
if(cn>=q) if(ans[q]-ans[1]<Ans) Ans=ans[q]-ans[1];
cn=0;
}
printf("%d\n",Ans);
return 0;
} |
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int p=2005;
int n,m,q,a[p],w[p],ans;
int hs(int i,int mid)
{
int s=0,len=0,sum=0;
for(int j=1;j<=n;++j)
if(a[j]<w[i])
sum+=min(s,max(0,len-m+1)),s=0,len=0;
else if(a[j]>w[mid])++len;
else ++len,++s;
return sum+min(s,max(0,len-m+1));
}
int main()
{
scanf("%d%d%d",&n,&m,&q);
for(int i=1;i<=n;++i)
scanf("%d",&a[i]),w[i]=a[i];
sort(w+1,w+n+1);
ans=w[n]-w[1];
//for(int i=1;i<=n;++i)printf("%d ",w[i]);printf("\n");
for(int i=1;i+q-1<=n;++i)
{
//printf("i %d\n",i);
if(hs(i,n)<q)break;
int l=i+q-1,r=n;
while(l<r)
{
int mid=(l+r)/2;
if(hs(i,mid)<q)l=mid+1;
else r=mid;
}
//printf("l %d\n",l);
ans=min(ans,w[l]-w[i]);
}
printf("%d",ans);
return 0;
}
/*
>=w[i],<=w[mid]
*/ |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.