D. Walking Robot
time limit per test
2 seconds
memory limit per test
256 megabytes
There is a robot staying at X=0X=0 on the OxOx axis. He has to walk to X=nX=n. You are controlling this robot and controlling how he goes. The robot has a battery and an accumulator with a solar panel.
The ii-th segment of the path (from X=i−1X=i−1 to X=iX=i) can be exposed to sunlight or not. The array ss denotes which segments are exposed to sunlight: if segment ii is exposed, then si=1si=1, otherwise si=0si=0.
The robot has one battery of capacity bb and one accumulator of capacity aa. For each segment, you should choose which type of energy storage robot will use to go to the next point (it can be either battery or accumulator). If the robot goes using the battery, the current charge of the battery is decreased by one (the robot can't use the battery if its charge is zero). And if the robot goes using the accumulator, the current charge of the accumulator is decreased by one (and the robot also can't use the accumulator if its charge is zero).
If the current segment is exposed to sunlight and the robot goes through it using the battery, the charge of the accumulator increases by one (of course, its charge can't become higher than it's maximum capacity).
If accumulator is used to pass some segment, its charge decreases by 1 no matter if the segment is exposed or not.
You understand that it is not always possible to walk to X=nX=n. You want your robot to go as far as possible. Find the maximum number of segments of distance the robot can pass if you control him optimally.
Input
The first line of the input contains three integers n,b,an,b,a (1≤n,b,a≤2⋅1051≤n,b,a≤2⋅105) — the robot's destination point, the battery capacity and the accumulator capacity, respectively.
The second line of the input contains nn integers s1,s2,…,sns1,s2,…,sn (0≤si≤10≤si≤1), where sisi is 11 if the ii-th segment of distance is exposed to sunlight, and 00 otherwise.
Output
Print one integer — the maximum number of segments the robot can pass if you control him optimally.
Examples
input
5 2 1 0 1 0 1 0
output
5
input
6 2 1 1 0 0 1 0 1
output
3
Note
In the first example the robot can go through the first segment using the accumulator, and charge levels become b=2b=2 and a=0a=0. The second segment can be passed using the battery, and charge levels become b=1b=1 and a=1a=1. The third segment can be passed using the accumulator, and charge levels become b=1b=1 and a=0a=0. The fourth segment can be passed using the battery, and charge levels become b=0b=0 and a=1a=1. And the fifth segment can be passed using the accumulator.
In the second example the robot can go through the maximum number of segments using battery two times and accumulator one time in any order.
題意：
有n段路, 每段路有兩種狀態，有陽光和沒陽光。沒陽光要耗費一單位電量，a,b都可以消耗。 當有陽光時在a電池電量不滿的情況下。可以消耗b的電量走過陽光區，同時又可以給a電池充一單位的電。當a 電池的電滿時就不能充電了。
b, a的初始值就是這兩種電池的容量。
AC代碼：
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <stack>
#include <map>
#include <set>
#include <cassert>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<long, long> PLL;
const ll mod = 1e9+7;
const int N = 1e6;
ll n,m,k; ll ans=0;
int a,b;
int s[200005];
int main() {
cin>>n>>b>>a;
for(int i=0;i<n;i++){
cin>>s[i];
}
int A=a,B=b;
for(int i=1;i<=n;i++){
if( s[i-1]== 1){
if(a==A){
a--;
}
else if(b>0){
b--;
a++;
}
else if(b<=0&&a>0){
a--;
}
else if(a<=0&&b<=0){
cout<<i-1;
return 0;
}
}
else{
if(a>0)a--;
else if(b>0) b--;
else{
cout<<i-1;
return 0;
}
}
}
cout<<n;
return 0;
}