Submission #2711038

---

Source Code Expand

#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) (a.begin()),(a.end())
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
typedef __int128_t lll;
typedef pair<lll,lll> plll;
typedef vector<lll> vlll;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename A, size_t N, typename T>void Fill(A (&array)[N], const T&v)
{fill((T*)array,(T*)(array+N),v);}
template<typename T> T gcd(T a,T b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
ll modpow(lll a,lll n,ll m){if(a==0)return a;lll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n, k, q, a[2005];
vi v, vv;
bool b[2005];
map<int, vi> m;

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n >> k >> q;
  FOR(i, 0, n){
    cin >> a[i];
    if(m.find(a[i]) == m.end()) m[a[i]] = vi();
    m[a[i]].pb(i);
  }
  b[n] = true;
  int ans = iinf;
  each(itr, m){
    v.resize(0);
    vv.resize(0);
    int c = 0;
    FOR(i, 0, n+1){
      if(b[i]){
        if(i - c >= k){
          sort(rng(vv));
          FOR(j, 0, i-c-k+1) v.pb(vv[j]);
        }
        vv.resize(0);
        c = i+1;
      }else{
        vv.pb(a[i]);
      }
    }
    if(sz(v) < q) break;
    sort(rng(v));
    if(v[0] == itr->fi) mins(ans, v[q-1] - itr->fi);
    each(itrr, itr->se) b[*itrr] = true;
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result