P1412 经营与开发

传送门（洛谷）

此题思维难度较大
1.若按照从前往后推，钻头的值对后续有影响，无法递推，则从后向前

2.$w\ast [a1+a2\ast (1-0.01k)+a3\ast (1-0.01k{)}^2+a4\ast (1-0.01k{)}^3.....]//w可以最后乘$

$若f[i-1]=a2+a3\ast (1-0.01k),则f[i]=a1+a2\ast (1-0.01k)+a3\ast (1-0.01{)}^2=a1+f[i-1]\ast (1-0.01k)$

Code

#include<bits/stdc++.h>
#define ll long long
#define mod 1000000007
#define rep(i,a,b) for(register int (i)=(a);(i)<=(b);(i)++)
#define don(i,a,b) for(register int (i)=(a);(i)>=(b);(i)--)
using namespace std;
const int maxn=1e5+10;
const int maxm=1e3+10;
int n,k,c,w;
int b[maxn],a[maxn];
double f[maxn];

template <class t> inline void read(t &x)
{
    x=0;int f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
    while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
    x*=f;
}

void readdata()
{
	memset(f,false,sizeof(f));
	read(n),read(k),read(c),read(w);
}

void work()
{
	rep(i,1,n) {
		read(a[i]);
		read(b[i]);
	}
	don(i,n,1) {
		if(a[i]==1) f[i]=max(f[i+1],b[i]+f[i+1]*(1-0.01*k));//具体见上面
		if(a[i]==2) f[i]=max(f[i+1],-b[i]+f[i+1]*(1+0.01*c));
	}
	printf("%.2lf\n",f[1]*w);
}

int main()
{
	//freopen("input.txt","r",stdin);
	readdata();
	work();
	return 0;
}