-
Notifications
You must be signed in to change notification settings - Fork 0
/
dpc2.cpp
54 lines (45 loc) · 1.04 KB
/
dpc2.cpp
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
#include <iostream>
#include <cstring>
#include <stdlib.h>
using namespace std;
#define sc(n) scanf("%d", &n)
#define scs(n) scanf("%s", &n)
#define pr(n) printf("%d\n", n);
#define ll long long;
int dp[101][101][101], n;
int R[101], B[101];
int f(int i, int r, int b) {
if(i==n || (r==0 && b==0))
return 0;
if(dp[i][r][b]!=-1) return dp[i][r][b];
int x, y;
if(r>=R[i] && b>=B[i])
x=f(i+1, r-R[i], b-B[i])+1;
y=f(i+1, r, b);
dp[i][r][b]= x>y?x:y;
return dp[i][r][b];
}
int main()
{
sc(n);
char s[100];
memset(R, 0, sizeof R);
memset(B, 0, sizeof B);
for(int i=0; i<n; i++) {
scs(s);
for(int j=0; s[j]!='\0'; j++) {
if(s[j]=='R')
R[i]++;
else
B[i]++;
}
}
int q;sc(q);
while(q--) {
memset(dp, -1, sizeof dp);
int a,b;sc(a);sc(b);
f(0, a, b);
pr(dp[0][a][b]);
}
return 0;
}