UOJ Logo

NOI.AC

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#212015#3816. 元素huangyuhang40245ms1248kbC++744b2024-10-13 10:11:322024-10-13 12:13:01

answer

#include<bits/stdc++.h>
using namespace std;
int n,q,l,r,ans;
int a[2005];
void DFS(int step,int end,int k,set<int>&T)
{
	T.insert(a[end]);
	if(step+1>=ans)
		return;
	if(T.size()==k)
	{
		ans=step+1;
		return;
	}
	else
	{
		DFS(step+1,end+1,k,T);
	}
}
int main()
{
	//freopen("B.in","r",stdin);
//	freopen("B.out","w",stdout);
	scanf("%d %d",&n,&q);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	while(q--)
	{
  		scanf("%d %d",&l,&r);
		set<int>S;
		for(int i=l;i<=r;i++)
			S.insert(a[i]);
		if(S.size()==r-l+1)
		{
			printf("%d\n",r-l+1);
			continue;
		}
		set<int>T;
		ans=2000+10;
		for(int i=l;i<=r;i++)
		{
			T.clear();
			DFS(0,i,S.size(),T);
		}

		printf("%d\n",ans);
	}
	return 0;
}

Details

小提示:点击横条可展开更详细的信息

Test #1:

score: 10
Accepted
time: 0ms
memory: 1232kb

input:

10 10
492 1887 1028 1209 252 1860 1527 699 1656 928
6 9
2 8
3 10
2 3
1 8
6 9
3 5
4 7
1 4
2 7

output:

4
7
8
2
8
4
3
4
4
6

result:

ok 10 numbers

Test #2:

score: 10
Accepted
time: 0ms
memory: 1228kb

input:

50 50
413 1208 1780 279 1403 1706 11 1583 333 355 1068 1270 1835 1042 957 423 1140 1153 1709 284 281...

output:

10
15
34
19
3
24
16
26
47
15
25
10
8
11
6
6
24
2
31
5
14
5
1
11
10
14
21
13
26
42
1
2
15
26
19
19
24...

result:

ok 50 numbers

Test #3:

score: 0
Wrong Answer
time: 0ms
memory: 1236kb

input:

50 50
407 1089 1459 1626 1917 555 1611 492 443 1149 406 1259 1729 1554 577 1310 1899 1578 1005 1459 ...

output:

31
10
3
14
1
26
1
36
16
48
27
28
14
21
5
18
2
2
25
1
12
15
23
2
35
6
21
28
7
7
5
9
29
4
32
27
33
21
...

result:

wrong answer 1st numbers differ - expected: '32', found: '31'

Test #4:

score: 0
Wrong Answer
time: 0ms
memory: 1232kb

input:

50 50
1792 843 1272 547 698 1086 1174 1607 1277 1055 506 881 1445 372 1076 1770 647 1086 320 1912 18...

output:

34
19
37
21
5
9
18
40
9
12
6
34
38
19
10
22
26
48
9
25
4
27
1
19
47
5
16
16
5
44
1
8
49
14
32
13
26
...

result:

wrong answer 3rd numbers differ - expected: '38', found: '37'

Test #5:

score: 10
Accepted
time: 0ms
memory: 1228kb

input:

50 50
44 1463 245 1177 1728 1335 768 475 790 623 1466 98 672 230 339 1428 872 1905 405 1260 1503 813...

output:

19
25
1
20
10
13
46
41
31
1
24
24
6
11
4
3
19
41
7
20
36
17
19
2
2
3
4
33
19
12
29
23
18
9
28
21
22
...

result:

ok 50 numbers

Test #6:

score: 10
Accepted
time: 0ms
memory: 1232kb

input:

50 50
695 974 1078 231 500 498 1308 1666 1925 766 1994 1776 1955 1766 1191 1021 1581 1202 615 1230 1...

output:

11
3
15
43
24
10
46
5
12
28
30
5
36
17
22
14
14
8
35
4
18
43
2
7
28
5
24
11
12
14
28
9
8
16
40
12
33...

result:

ok 50 numbers

Test #7:

score: 0
Wrong Answer
time: 124ms
memory: 1248kb

input:

200 200
403 329 389 1103 695 1865 818 671 750 1868 1422 422 1186 1431 172 1569 460 1580 406 1049 138...

output:

131
104
20
9
45
59
157
47
137
36
81
79
35
134
78
13
141
33
15
107
110
27
79
157
38
63
52
6
59
167
49...

result:

wrong answer 6th numbers differ - expected: '60', found: '59'

Test #8:

score: 0
Wrong Answer
time: 121ms
memory: 1244kb

input:

200 200
147 1386 1788 1493 1919 1136 861 871 1895 1006 1776 346 381 1666 296 289 568 1616 1535 531 2...

output:

103
92
132
62
2
2
59
154
64
99
11
65
2
74
2
108
128
8
32
22
10
121
132
30
29
55
156
43
191
6
54
12
2...

result:

wrong answer 2nd numbers differ - expected: '96', found: '92'

Test #9:

score: 0
Runtime Error

input:

2000 2000
1154 852 1088 1530 639 1318 1250 1222 1341 1070 205 656 903 1491 808 317 756 1962 102 1445...

output:


result:


Test #10:

score: 0
Runtime Error

input:

2000 2000
1232 731 1651 991 1681 1739 776 240 829 1337 493 248 214 1852 716 325 1280 1207 380 724 11...

output:


result: