Codeforces Round #444 (Div. 2), problem: (F) Row of Models Solution In C/C++
#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a,b,c,n,k,m,t; int main() { scanf("%d%d",&n,&k); for (int i=0;i<n;i++) scanf("%d",&a); a=0; memset(c,-1,sizeof(c)); m=0;b=0;c=0;t=0; for (int i=1;i<=n;i++) if (a<a]) b=i,c=m; for (int i=1;i<=m;i++) if (b-b>2*k) {puts("NO");return 0;} else if …