题目:
http://codeforces.com/problemset/problem/650/B
题意:
给定n,a,b,t与序列为s的照片,s[i]为w或h,
初始时处于s[0],每滑动一张照片消耗为a,浏览消耗为1,若s[i]为w,则必须消耗b翻转后才可浏览,处于s[0]时可左滑到s[n-1],反之亦然
问最大消耗为t的条件下,最多可浏览的照片数量
思路:
虽然可以随意左右滑动,但最优的消耗肯定是先往一侧滑,再往另一侧滑,即可以枚举最后浏览的照片序列,消耗是n^3,通过枚举区间的最左点,二分区间最右点降为n^2*lg(n),再通过预处理[1,l][r,n]区间的w数量降为n*lg(n)
太久没写题目出现了坑了挺久,在二分时忘记考虑可以不往左滑一直往右滑的情况
代码:
#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
const int MAXSIZE=5e5+5;
int n,a,b,t;
char str[MAXSIZE];
int lw[MAXSIZE]={0};
int rw[MAXSIZE]={0};
int predeal(){
if (str[0] == 'w') rw[0] = 1;
for (int i=1;i<n;++i)
rw[i] = str[i] == 'w' ? rw[i-1]+1 : rw[i-1];
if (str[n-1] == 'w') lw[n-1] = 1;
for (int i=n-1;i>-1;--i)
lw[i] = str[i] == 'w' ? lw[i+1]+1 : lw[i+1];
lw[n] = 0;
}
int calc(int l, int r){
int res = 0;
res += lw[l] * b + rw[r] * b;
res += min(n-l, r)*a + (n-l+r)*a;
//cout<<l<<" "<<r<<" "<<res<<endl;
return res + n-l+r+1;
}
int main(){
int maximum = 0;
scanf("%d %d %d %d",&n,&a,&b,&t);
scanf("%s",str);
predeal();
if ((str[0] == 'w' && b+1<=t) || (str[0] == 'h')) {
maximum = 1;
for (int i=1;i<=n;++i){
int l = 0, r = i - 1;
int ans = -1;
while (l<=r){
int mid = (l+r)/2;
if (calc(i,mid) <= t){
ans = mid;
l = mid + 1;
}
else {
r = mid - 1;
}
}
if (ans != -1){
if (n - i + ans + 1 > maximum) maximum = n - i + ans + 1;
}
if (maximum == n) break;
}
}
printf("%d\n",maximum);
return 0;
}