Ural 2072

题意：浇花，必须以权值从小到大浇水，左右走一步需要一秒，浇完所有的花最少需要多少时间。
思路：当走到某一步时，发现左右都有权值相同的，这就要考虑往左走还是往右走，所以记忆化处理一下，每次取最小值。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long LL;
const int maxn = 100007;
int n;

struct Node {
    LL val, id;
    bool operator < (const Node& rhs) const {
        return val < rhs.val || (val == rhs.val && id < rhs.id);
    }
}p[maxn];

int main() {
    scanf("%d", &n);
    for(int i = 0; i < n; ++i) scanf("%lld", &p[i].val), p[i].id = i;
    sort(p, p+n);
    LL prel = 0, prer = 0;
    LL ansl = 0, ansr = 0;
    for(int i = 0; i < n; ++i) {
        int j, cnt = i;
        for(j = i+1; j < n; ++j) if(p[i].val != p[j].val) break;
        cnt = j-1;

        LL l = p[i].id, r = p[cnt].id;

        LL aansl = abs(l-r) + min(abs(r-prel)+ansl, abs(r-prer)+ansr);
        LL aansr = abs(l-r) + min(abs(l-prel)+ansl, abs(l-prer)+ansr);


        prel = l; prer = r;
        ansl = aansl; ansr = aansr;
        i = cnt;
    }
    printf("%lld\n", min(ansl, ansr)+n);
}