URAL
来源:互联网 发布:hadoop mac和linux 编辑:程序博客网 时间:2024/04/28 13:23
2072. Kirill the Gardener 3
Time limit: 2.0 second
Memory limit: 64 MB
Memory limit: 64 MB
Kirill the gardener has got a new task. He has to water the flowers growing on the huge flowerbed! It should be mentioned that the bed is very long and narrow at the same time. So from bird’s-eye view (and Kirill growth too) it looks like a straight line, where n points-flowers are located at regular intervals. For this job Kirill has a watering pot of infinite volume and smartwatch that shows moisture content of each flower before watering. The watering takes too much time, so the most dried flowers can die, which is unacceptable. So Kirill decided to water the flowers in order of their non-decreasing dryness. On the other hand, he wants to finish the watering as soon as possible, because there are a lot of other interesting things.
Assume that watering of one flower and walking between two neighbor flowers takes Kirill one minute. Can you figure out the time in which the young gardener will complete his job if he acts optimally? Initially Kirill stands near the leftmost flower.
Input
The first line contains an integer n (1 ≤ n ≤ 105) — it’s amount of flowers in the flowerbed. The second line contains n integers separated by spaces — it‘s moisture content of flowers given in order of their positions in the flowerbed from left to right. Moisture content is an integer from 1 up to 109 (including both).
Output
In the only line print an integer — the minimal time in which Kirill would complete watering.
Sample
63 2 5 6 2 5
21
Notes
There is one of the possible ways to finish up in 21 minutes in the example:
- Go from the 1st to the 5th flower (4 minutes)
- Water the 5th flower (1 minute)
- Go from the 5th to the 2nd flower (3 minutes)
- Water the 2nd flower (1 minute)
- Go from the 2nd to the 1st flower (1 minute)
- Water the 1st flower (1 minute)
- Go from the 1st flower to the 3rd flower (2 minutes)
- Water the 3rd flower (1 minute)
- Go from the 3rd flower to the 6th flower (3 minutes)
- Water the 6th flower (1 minute)
- Go from the 6th flower to the 4th flower (2 minutes)
- Water the 4th flower (1 minute)
Problem Author: Ilya Kuchumov
Problem Source: Ural Regional School Programming Contest 2015
Problem Source: Ural Regional School Programming Contest 2015
Tags: dynamic programming
)Difficulty: 186 Printable version Submit solution Discussion (3)
All submissions (2095) All accepted submissions (669) Solutions rating (419)
All submissions (2095) All accepted submissions (669) Solutions rating (419)
可以把一样的数看为一层,必须走完这一层才可以走下一层,然后就是选择每一层从左先走还是从右先走
#include<bits/stdc++.h>using namespace std;int l[100005],r[100005],a[100005],b[100005];long long int dp[2][2];map<int,int>mp;int cmp(int u,int v){return u<v;}int main(){int i,index,n,a[100005],t=1;scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&a[i]);b[i]=a[i];}sort(b+1,b+n+1,cmp);for(i=1;i<=n;i++){if(!mp.count(b[i])){mp[b[i]]=t++;}}//printf("%d\n",t);for(i=1;i<=n;i++){index=mp[a[i]];if(l[index]==0){l[index]=r[index]=i;}else{r[index]=i;}}long long int ans=0;for(i=1;i<t;i++){ans+=r[i]-l[i];//printf("%d %d\n",l[i],r[i]);}for(i=1;i<t;i++){if(i==1){dp[0][0]=abs(l[i]-1);dp[0][1]=abs(r[i]-1);}else{dp[1][0]=min(dp[0][0]+abs(l[i]-r[i-1]),dp[0][1]+abs(l[i]-l[i-1]));dp[1][1]=min(dp[0][0]+abs(r[i]-r[i-1]),dp[0][1]+abs(r[i]-l[i-1]));dp[0][1]=dp[1][1];dp[0][0]=dp[1][0];}//printf("%d %d %d %d\n",dp[0][0],dp[0][1],dp[1][0],dp[1][1]);}printf("%lld\n",min(dp[1][0],dp[1][1])+n+ans);return 0;}
0 0
- URAL
- 【ural】
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- URAL
- 跨园区容灾,升级不停服——高可用负载均衡集群实践
- jsp九大内置对象和四种属性范围介绍
- MySQL的时间字段的选择
- Huber损失最小化学习法
- 简单说一下我是如何解决 ViewPager 在 notifyDataChanged 之后不及时刷新的问题的
- URAL
- Gym
- 计算机科学和编程导论-week2-函数
- SQL注入
- c语言 背包问题dfs方法
- VS或VC调用matlab程序
- linux下搜狗输入法不能输入中文的解决方案
- poj 3292 打表
- Mac 序列号"不可用"导致超时代视频加密视频播放失败