-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathNPC2014F.cpp
More file actions
63 lines (56 loc) · 769 Bytes
/
Copy pathNPC2014F.cpp
File metadata and controls
63 lines (56 loc) · 769 Bytes
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
#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int main(int argc, char const *argv[])
{
int l;
int t;
cin>>l;
string s;
cin>>s;
vector<int> req(26,0);
cin>>t;
int r;
char c;
for (int i = 0; i < t; ++i)
{
cin>>r>>c;
req[c-'a']=r;
}
int st=0,en=0;
int minsize=9999999,found=0,temp;
while(st<=en && en <= l){
int ok=1;
for (int i = 0; i < 26; ++i)
{
if(req[i]>0){
ok=0;
break;
}
}
if(ok){
found=1;
temp=en-st;
if(temp<minsize)
minsize=temp;
req[s[st]-'a']++;
st++;
}
else{
if(en<l)
req[s[en]-'a']--;
else
break;
en++;
}
}
if(found)
cout<<minsize;
else
cout<<"Andy rapopo";
return 0;
}