-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path00111.cpp
More file actions
80 lines (78 loc) · 1.89 KB
/
00111.cpp
File metadata and controls
80 lines (78 loc) · 1.89 KB
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
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,ans[25],student[25],k,rak[25],lev[25];
vector<int> last;
char input[100];
bool e(false);
fgets(input,100,stdin);
n=atoi(input);
while(1)
{
for(int i=0;i<n;i++)
{
scanf("%d",&k);
rak[k-1]=i;
}
for(int i=0;i<n;i++)
{
ans[rak[i]]=i;
}
if(fgets(input,100,stdin)==NULL)
{
break;
}
while(1)
{
if(fgets(input,100,stdin)==NULL)
{
e = true;
break;
}
else
{
if(strstr(input," ")==NULL)
{
n= atoi(input);
break;
}
else
{
char *ptr = input;
for(int i=0;i<n;i++)
{
sscanf(ptr,"%d",&k);
lev[k-1] = i;
ptr+=2;
if(ptr[0]==' ')
ptr++;
}
}
}
for(int i=0;i<n;i++)
{
student[i] = ans[lev[i]];
}
last.clear();
last.push_back(-1);
vector<int>::iterator it;
for(int i=0;i<n;i++)
{
it = lower_bound(last.begin(),last.end(),student[i]);
if(it==last.end())
{
last.push_back(student[i]);
}
else
{
*it=student[i];
}
}
printf("%d\n",last.size()-1);
}
if(e)
break;
}
return 0;
}