-
Notifications
You must be signed in to change notification settings - Fork 1
/
an.c
120 lines (102 loc) · 2.05 KB
/
an.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include<stdio.h>
#include<conio.h>
int main()
{ int z=0;
scanf("%d",&z);
int i,k,l,n,b=0,t,r[18],m,w,f=0,flag,c1=0,index[20]={0},r1[20],index1[20]={0},c2=0;
while(z--)
{
c1=0;
c2=0;
b=0;
f=0;
scanf("%d %d %d",&n,&k,&w);
for(i=0;i<n;i++)
{
scanf("%d",&r[i]);
r1[i]=r[i];
}
i=n-k;
while(i>=0)
{flag=0;int u=i,j;
m=0;
for(j=i+k-1;j>=i;j--)
{
if(r[j]>m)
{
m=r[j];
f=j;
b++;
}
}
int pos[20]={0},count=0,x=0;
for(j=i+k-1;j>=i;j--)
{
if(r[j]==m)
{flag++;
pos[count]=j;
count++;}
}
if(b==0)
{
flag=w;
f=i+k-1;
}
if(flag>=w)
{
while(index[f]!=0)
{
x++;
f=pos[x];
}
r[f]++;
index[f]++;
c1++;}
i--;}
i=0;
while(i<=(n-k))
{flag=0;int u=i,j;
m=0;
for(j=i+k-1;j>=i;j--)
{
if(r1[j]>m)
{
m=r1[j];
f=j;
b++;
}
}
int pos[20]={0},count=0,x=0;
for(j=i+k-1;j>=i;j--)
{
if(r1[j]==m)
{flag++;
pos[count]=j;
count++;}
}
if(b==0)
{
flag=w;
f=i+k-1;
}
if(flag>=w)
{
while(index1[f]!=0)
{
x++;
f=pos[x];
}
r1[f]++;
index1[f]++;
c2++;}
i++;}
if(w==1)
{
printf("-1\n");
}
else
{
printf("%d\n",c1>=c2?c2:c1);
}
}
}