Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define PB push_back
- #define ZERO (1e-10)
- #define INF (1<<29)
- #define CL(A,I) (memset(A,I,sizeof(A)))
- #define DEB printf("DEB!\n");
- #define D(X) cout<<" "<<#X": "<<X<<endl;
- #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
- typedef long long ll;
- typedef long double ld;
- typedef pair<ll,ll> pll;
- typedef vector<int> vi;
- typedef pair<int,int> ii;
- typedef vector<ii> vii;
- #define IN(n) int n;scanf("%d",&n);
- #define FOR(i, m, n) for (int i(m); i < n; i++)
- #define REP(i, n) FOR(i, 0, n)
- #define F(n) REP(i, n)
- #define FF(n) REP(j, n)
- #define FT(m, n) FOR(k, m, n)
- #define aa first
- #define bb second
- void ga(int N,int *A){F(N)scanf("%d",A+i);}
- #define MX (1<<17)
- int N,K,A[MX],B;
- multiset<int> S;
- int main(void){
- IN(tt)F(tt){
- scanf("%d%d",&N,&K),ga(N,A),B=0,S.clear(),K=min(K+1,N-1);
- F(K+1)S.insert(A[i]);
- F(N-K)B=max(B,*--S.end()-*S.begin()),S.erase(S.find(A[i])),S.insert(A[i+K+1]);
- printf("%d\n",B);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement