动态规划
传送门(洛谷)
题目描述:
以f[i][j]表示第j天在i号城市的状态(可能是早就在这个城市,也可能是才来)
得到以下的状态转移方程:
f[i][j]=min(f[i][j-1],f[i-1][j-1]+d[i]*c[j]);
剩下的就直接找答案了
Code
#include<bits/stdc++.h>
#define ll long long
#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,m,cnt=0;
int f[maxm][maxm];
int d[maxn],c[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;
}
template <class t> inline void write(t x)
{
if(x<0){putchar('-');x=~x+1;}
if(x>9) write(x/10);
putchar(x%10+48);
}
/*--------------------------------------------------------------------------------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------------------------------------------------------------------------------*/
void readdata()
{
memset(f,127,sizeof(f));
read(n),read(m);
rep(i,1,n) read(d[i]);
rep(i,1,m) read(c[i]);
}
void work()
{
for(int i=0;i<=m;i++) f[0][i]=0;
rep(i,1,n) {
rep(j,i,m)
f[i][j]=min(f[i][j-1],f[i-1][j-1]+d[i]*c[j]);
}
int ans=INT_MAX;
rep(i,1,m) ans=min(f[n][i],ans);
write(f[n][m]);
}
int main()
{
freopen("input.txt","r",stdin);
readdata();
work();
return 0;
}