题意：

思路：

首先证明一个结论：一个数最多被加两次。
首先假设a[i]=a[i−1]a[i]=a[i-1]a[i]=a[i−1]或a[i]=a[i+1]a[i]=a[i+1]a[i]=a[i+1]，那么此时可以将a[i]=a[i]+1a[i]=a[i]+1a[i]=a[i]+1，若此时a[i]=a[i−1]a[i]=a[i-1]a[i]=a[i−1]或a[i]=a[i+1]a[i]=a[i+1]a[i]=a[i+1]，那么可以将其再加一，这个时候一定与两边的都不想等，此时再加就没有意义了。
既然只能加两次，那么定义f[i][j]f[i][j]f[i][j]表示到了第iii个位置，这个数加了jjj次后满足条件的最小代价，转移方程：f[i][j]=min(f[i][j],f[i−1][k]+j∗b[i])f[i][j]=min(f[i][j],f[i-1][k]+j*b[i])f[i][j]=min(f[i][j],f[i−1][k]+j∗b[i])
注意初始化的时候要将其设为尽可能大的数。
代码中101010改成333即可，当时是猜了个结论。

// Problem: D. Make The Fence Great Again
// Contest: Codeforces - Educational Codeforces Round 73 (Rated for Div. 2)
// URL: https://codeforces.com/contest/1221/problem/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
//
// Powered by CP Editor (https://cpeditor.org)//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<random>
#include<cassert>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid ((tr[u].l+tr[u].r)>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;const int N=300010,mod=1e9+7,INF=0x3f3f3f3f;
const LL inf=0x3f3f3f3f3f3f3f3f;
const double eps=1e-6;int n;
int a[N],b[N];
LL f[N][20];int main()
{//  ios::sync_with_stdio(false);
//  cin.tie(0);int _; scanf("%d",&_);while(_--) {scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d%d",&a[i],&b[i]);for(int i=1;i<=n;i++) for(int j=0;j<=10;j++) f[i][j]=inf;for(int i=0;i<=10;i++) f[1][i]=1ll*b[1]*i;for(int i=2;i<=n;i++) {for(int j=0;j<=10;j++) {for(int k=0;k<=10;k++) {if(a[i-1]+k!=a[i]+j) f[i][j]=min(f[i][j],f[i-1][k]+1ll*j*b[i]);}}}LL ans=inf;for(int i=0;i<=10;i++) ans=min(ans,f[n][i]);printf("%lld\n",ans);}return 0;
}
/**/

Educational Codeforces Round 73 (Rated for Div. 2) Make The Fence Great Again dp + 结论相关推荐

Educational Codeforces Round 73 (Rated for Div. 2) F. Choose a Square 线段树 + 二维转一维
传送门文章目录题意: 思路: 题意: 给你nnn个点(xi,yi)(x_i,y_i)(xi,yi),每个点有个价值cic_ici,现在你可以框一个正方形,要求左下角和右上角的坐标(x,y)( ...
Educational Codeforces Round 73 (Rated for Div. 2) E. Game With String 思维博弈好题（2500)
传送门文章目录题意: 思路: 题意: 思路: 我们将每一段...拿出来看成若干段,将其分成以下四种情况: (1)len<b(1)len<b(1)len<b (2)b≤len< ...
Educational Codeforces Round 111 (Rated for Div. 2) E. Stringforces 二分 + 状压dp
传送门文章目录题意: 思路: 题意: 给你一个串,只包含前kkk个字母和???,定义fif_ifi表示第iii个字母在串中出现的最长连续长度,你现在需要将???替换为前kkk个字母,使得mini ...
Educational Codeforces Round 73 (Rated for Div. 2)
A 很简单的一个模拟,只要前面的数字有两个以上就能合成后面的,我们进行一遍合成看能不能出现2048就可以了. #include<cstdio> #include<cstring> ...
Educational Codeforces Round 81 (Rated for Div. 2) E. Permutation Separation 线段树 + dp
传送门文章目录题意: 思路: 题意: 给你一个打乱的排列,每个位置都各有一个价值,让你选择一个分界点,分成p1,p2,...,prp_1,p_2,...,p_rp1,p2,...,pr和pr ...
Educational Codeforces Round 77 (Rated for Div. 2) C. Infinite Fence 数论
传送门文章目录题意: 思路: 题意: 思路: 碰到这样的题肯定是先写几个找找规律了,随便写几个就可以发现是以lcm(a,b)lcm(a,b)lcm(a,b)为一个循环,所以我们只需要在一个周期lc ...
Educational Codeforces Round 90 (Rated for Div. 2)（A, B, C, D, E）
Educational Codeforces Round 90 (Rated for Div. 2) Donut Shops 思路分三种情况: a==c/ba == c / ba==c/b这个时候两 ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...
Educational Codeforces Round 106 (Rated for Div. 2)（A ~ E）题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 Educational Codeforces Round 106 (Rated for Div. ...

Educational Codeforces Round 73 (Rated for Div. 2) Make The Fence Great Again dp + 结论

文章目录

题意：

思路：

Educational Codeforces Round 73 (Rated for Div. 2) Make The Fence Great Again dp + 结论相关推荐

最新文章

热门文章