看了半天才发现其实这不算一道DP
O ( n 2 ) O(n^2) O(n2)做法
大意很好理解,就不再赘述了
首先,我们可以肯定的是:锯木厂一定建在树旁边(要不然多跑一段冤枉路)
为了方便思考,我们倒序输入,将山脚下的树定为第一棵树
f
i
f_i
fi表示将第2个锯木厂建在第
i
i
i棵树旁边的总共最小花费
那么方程就出来了:
f
i
=
∑
k
=
i
n
a
k
(
d
i
s
k
−
d
i
s
i
)
+
∑
k
=
j
i
−
1
a
k
(
d
i
s
k
−
d
i
s
j
)
+
∑
k
=
1
j
−
1
a
k
d
i
s
k
f_i=\sum\limits^{n}_{k=i}a_k(dis_k-dis_i)+\sum\limits^{i-1}_{k=j}a_k(dis_k-dis_j)+\sum\limits^{j-1}_{k=1}a_kdis_k
fi=k=i∑nak(disk−disi)+k=j∑i−1ak(disk−disj)+k=1∑j−1akdisk
再加上玄学前缀和优化
s
i
=
∑
j
=
1
i
a
j
∗
d
i
s
j
s_i=\sum\limits^{i}_{j=1}a_j*dis_j
si=j=1∑iaj∗disj
s
u
m
i
=
∑
j
=
1
i
a
j
sum_i=\sum\limits^{i}_{j=1}a_j
sumi=j=1∑iaj
f
i
=
s
n
−
s
i
−
1
−
d
i
s
i
(
s
u
m
n
−
s
u
m
i
−
1
)
+
s
i
−
1
−
s
j
−
1
−
d
i
s
j
(
s
u
m
i
−
1
−
s
u
m
j
−
1
)
+
s
j
−
1
f_i=s_n-s_{i-1}-dis_i(sum_n-sum_{i-1})+s_{i-1}-s_{j-1}-dis_j(sum_{i-1}-sum_{j-1})+s_{j-1}
fi=sn−si−1−disi(sumn−sumi−1)+si−1−sj−1−disj(sumi−1−sumj−1)+sj−1
整理一下会发现方程还可以化简:
f
i
=
s
n
−
d
i
s
i
(
s
u
m
n
−
s
u
m
i
−
1
)
−
d
i
s
j
(
s
u
m
i
−
1
−
s
u
m
j
−
1
)
f_i=s_n-dis_i(sum_n-sum_{i-1})-dis_j(sum_{i-1}-sum_{j-1})
fi=sn−disi(sumn−sumi−1)−disj(sumi−1−sumj−1)
然后……
我
惊
讶
地
A
C
了
!
!
!
\huge 我惊讶地AC了!!!
我惊讶地AC了!!!
O
(
n
2
)
算
法
!
!
!
\huge O(n^2)算法!!!
O(n2)算法!!!
水
得
不
像
话
!
!
!
\huge 水得不像话!!!
水得不像话!!!
咳咳咳我们还是要来打一打正解的……
优化
老样子
f
i
=
s
n
−
d
i
s
i
(
s
u
m
n
−
s
u
m
i
−
1
)
−
d
i
s
j
(
s
u
m
i
−
1
−
s
u
m
j
−
1
)
f_i=s_n-dis_i(sum_n-sum_{i-1})-dis_j(sum_{i-1}-sum_{j-1})
fi=sn−disi(sumn−sumi−1)−disj(sumi−1−sumj−1)
f
i
=
s
n
−
d
i
s
i
s
u
m
n
+
d
i
s
i
s
u
m
i
−
1
−
d
i
s
j
s
u
m
i
−
1
+
d
i
s
j
s
u
m
j
−
1
f_i=s_n-dis_isum_n+dis_isum_{i-1}-dis_jsum_{i-1}+dis_jsum_{j-1}
fi=sn−disisumn+disisumi−1−disjsumi−1+disjsumj−1
f
i
−
s
n
+
d
i
s
i
s
u
m
n
−
d
i
s
i
s
u
m
i
−
1
=
d
i
s
j
(
s
u
m
j
−
1
−
s
u
m
i
−
1
)
f_i-s_n+dis_isum_n-dis_isum_{i-1}=dis_j(sum_{j-1}-sum_{i-1})
fi−sn+disisumn−disisumi−1=disj(sumj−1−sumi−1)
d
i
s
j
s
u
m
j
−
1
=
d
i
s
j
s
u
m
i
−
1
+
f
i
−
s
n
+
d
i
s
i
s
u
m
n
−
d
i
s
i
s
u
m
i
−
1
dis_jsum_{j-1}=dis_jsum_{i-1}+f_i-s_n+dis_isum_n-dis_isum_{i-1}
disjsumj−1=disjsumi−1+fi−sn+disisumn−disisumi−1
y
=
d
i
s
j
s
u
m
j
−
1
y=dis_jsum_{j-1}
y=disjsumj−1
k
=
s
u
m
i
−
1
k=sum_{i-1}
k=sumi−1
x
=
d
i
s
j
x=dis_j
x=disj
b
=
f
i
−
s
n
+
d
i
s
i
s
u
m
n
−
d
i
s
i
s
u
m
i
−
1
b=f_i-s_n+dis_isum_n-dis_isum_{i-1}
b=fi−sn+disisumn−disisumi−1
另外
f
f
f数组也可以去掉
代码:
#include<cstdio>
#include<algorithm>
using namespace std;
struct deque
{
/*/
int list[110];//convinient for debug
/*/
int *list;//avoid the stack-crashing
//*/
int head,tail;//head~tail
/*/
deque():head(1),tail(0){}
/*/
deque():head(1),tail(0),list(new int[1110000]){}//avoid the stack-crashing
//*/
int size(){return tail-head+1;}
int front(){return list[head];}
void push_front(int x){list[--head]=x;}
void pop_front(){++head;}
int front_2nd(){return list[head+1];}
int back(){return list[tail];}
void push_back(int x){list[++tail]=x;}
void pop_back(){--tail;}
int back_2nd(){return list[tail-1];}
};
#define y(p) (dis[p]*sum[p-1])
#define k(p) (sum[p-1])
#define x(p) (dis[p])
int dis[21000];
long long sum[21000],s[21000];
double slope(int a,int b)
{return (y(a)-y(b))/(double)(x(a)-x(b));}
int main()
{
int n;
scanf("%d",&n);
for(int i=n;i>=1;i--)
scanf("%lld%d",sum+i,dis+i);
s[1]=sum[1]*dis[1];
for(int i=2;i<=n;i++)
dis[i]+=dis[i-1],s[i]=s[i-1]+sum[i]*dis[i],sum[i]+=sum[i-1];
long long ans=0x7fffffffffffffffll;
deque q;
q.push_back(0);
for(int i=1;i<=n;i++)
{
while(q.size()>1&&slope(q.front(),q.front_2nd())<k(i))q.pop_front();
int j=q.front();
ans=min(ans,s[n]-dis[i]*(sum[n]-sum[i-1])-dis[j]*(sum[i-1]-sum[j-1]));
while(q.size()>1&&slope(q.back_2nd(),q.back())>slope(q.back(),i))q.pop_back();
q.push_back(i);
}
printf("%lld",ans);
return 0;
}