Minimum Sum(思维+set)

5599: Minimum Sum

时间限制: 2 Sec   内存限制: 256 MB
提交: 141   解决: 47
[ 提交][ 状态][ 讨论版][命题人: admin]

题目描述

One day, Snuke was given a permutation of length N, a1,a2,…,aN, from his friend.

Find the following:

Constraints
1≤N≤200,000
(a1,a2,…,aN) is a permutation of (1,2,…,N).

输入

The input is given from Standard Input in the following format:
N
a1 a2 … aN

输出

Print the answer.
Note that the answer may not fit into a 32-bit integer.

样例输入

3

2 1 3

样例输出

9

提示

来源

AtCoder Grand Contest 005 

题解：记录下每个数的位置，然后按照数的大小排序，对于每一个数字，在set中查找大于它下标的数字的最小值，和小于它下标的最大值，则这个区间就是这个数字的影响区间，然后再将位置加入set集合中。同时注意set的初始化，加入0和n+1两个位置。

#include<stdio.h>
#include <algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#include<algorithm>
#define INF 0x3f3f3f3f
#define gcd(a,b) __gcd(a,b)
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define FAST_IO ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX=1e5+10;
const int mod=1e9+7;
typedef long long ll;
using namespace std;

inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv1(ll b){return qpow(b,mod-2);}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll r=exgcd(b,a%b,y,x);y-=(a/b)*x;return r;}
inline ll read(){ll x=0,f=1;char c=getchar();for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;for(;isdigit(c);c=getchar()) x=x*10+c-'0';return x*f;}

#define it set<int>::iterator
struct node
{
    ll v;
    int indx;
};
const int maxn=200000;

node a[maxn];

int cmp(node a,node b){return a.v<b.v;}
int main()
{
   int n;
   cin>>n;
   for(int i=1;i<=n;i++)
   {
       scanf("%lld",&a[i].v);
       a[i].indx=i;
   }
   sort(a+1,a+1+n,cmp);
   set<int>s;
   s.insert(0);
   s.insert(n+1);
   ll ans=0;
   for(int i=1;i<=n;i++)
   {
        it tail,head;
        tail=s.upper_bound(a[i].indx);
        head=s.upper_bound(a[i].indx);
        head--;
        ans+=a[i].v*(*tail-a[i].indx)*(a[i].indx-*head);
        s.insert(a[i].indx);
   }
   printf("%lld\n",ans);
}