最小乘车费用--动态规划

版权声明:转载请附上地址 https://blog.csdn.net/weixin_44574520/article/details/89533979

mzoj 1207

在这里插入图片描述

Code

#include <bits/stdc++.h>
using namespace std;

int n,a[15],f[1010];

inline void init_() {
	freopen("a.txt","r",stdin);
}

inline int read_() {
	int x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9') {
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9') {
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}

inline void readda_() {
	for(int i=1;i<=10;i++) a[i]=read_();
	n=read_();
}

inline void clean_() {
	memset(f,0x3f,sizeof(f));
}

inline void work_() {
	clean_();
	for(int i=1;i<=n;i++) {
		if(i<=10) f[i]=a[i];
		for(int j=1;j<=10;j++) {
			if(j>i) break;
			f[i]=min(f[i-j]+a[j],f[i]);
		}
	}
	printf("%d",f[n]);
}

int main() {
	init_();
	readda_();
	work_();
	return 0;
}

猜你喜欢

转载自blog.csdn.net/weixin_44574520/article/details/89533979