分析:
给出数字n,x,y。要求构成一个长度为n的字符串,增加或删除一个字符的花费为x,将当前字符 copy && paste 的花费为y,求构成长度为n的字符串的最小花费。题解:
设dp[i]为产生长度为i的字符的最小花费,直接比较两种方法即可:
if(i&1) //奇数长度:比较+1操作与一半数组((i-1)/2)*2+1和一半数组(((i-1)/2+1)*2-1)中的最小值
dp[i] = min(dp[i-1]+x, min(dp[i/2]+x+y, dp[i/2+1]+x+y))
else //偶数长度:直接比较+1操作与copy操作即可
dp[i] = min(dp[i-1]+x, dp[i/2]+y)
- AC代码:
/*************************************************************************
> File Name: test.cpp
> Author: Akira
> Mail: qaq.febr2.qaq@gmail.com
************************************************************************/
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cmath>
#include <vector>
#include <set>
#include <list>
#include <ctime>
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
#define MST(a,b) memset(a,b,sizeof(a))
#define CLR(a) MST(a,0)
#define Sqr(a) ((a)*(a))
using namespace std;
#define MaxN 10000001
#define MaxM MaxN*10
#define INF 0x3f3f3f3f
#define bug cout<<88888888<<endl;
int n;
LL x,y;
LL dp[MaxN];
void Min(LL &x, LL y){x = min(x,y);}
int main()
{
while(~scanf("%d%I64d%I64d",&n,&x,&y))
{
dp[1] = x;
for(int i=2;i<=n;i++)
{
if(i&1)
dp[i] = min(dp[i-1]+x, min(dp[i/2]+y+x, dp[i/2+1]+x+y));
else
dp[i] = min(dp[i-1]+x, dp[i/2]+y);
}
cout << dp[n]<<endl;
}
//system("pause");
}