Minimum Sum（单调栈或者用stl set二分）

Minimum Sum（单调栈或者用stl set二分）

 

 

代码1：me。从1开始，二分找比数i的位置大的，和小的。然后加上答案。因为set里其他的数都比当前的数小。

 

#pragma comment(linker, "/STACK:1024000000,1024000000")
#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
 
using namespace std;
 
#define rep(i , a , b) for(register int i=(a);i<=(b);i++)
#define per(i , a , b) for(register int i=(a);i>=(b);i--)
#define ms(s) memset(s, 0, sizeof(s))
#define squ(x) (x)*(x)
#define fi first
#define se second
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll , ll> pi;
typedef unordered_map<int,int> un_map;
typedef priority_queue<int> prque;
 
template<class T>
inline void read (T &x) {
    x = 0;
    int sign = 1;
    char c = getchar ();
    while (c < '0' || c > '9') {
        if ( c == '-' ) sign = - 1;
        c = getchar ();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - '0';
        c = getchar ();
    }
    x = x * sign;
}
 
const int maxn = 2e5 + 10;
const int inf = 1e9;
const ll INF = ll(1e18);
const int mod = 998244353;
const double PI = acos(-1);
//#define LOCAL
 
int n;
int vis[maxn];
set<int>p;
set<int>::iterator it;
void solve() {
    rep(i,1,n) {
        int x;
        read(x);
        vis[x]=i;
    }
    p.insert(0);
    p.insert(n+1);
    ll ans = 0;
    rep(i,1,n) {
        int x = vis[i];
        it = p.upper_bound(x);
        int y = *it;
        it--;
        int z = *it;
        p.insert(x);
        ans=ans+1ll*i*(y-x)*(x-z);
    }
    printf("%lld\n",ans);
}
 
int main(int argc, char * argv[])
{
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    #endif
     
    while(~scanf("%d",&n)) {
        solve();
    }
    return 0; 
}

代码二：单调栈，递减（找的一份）维护一个递减的。dp[i]表示加上第i个元素时的情况。

b[i]存的是比当前元素小的元素的下标。

#include<bits/stdc++.h>
#define int long long
using namespace std;
int a[200005],b[200005],dp[200005];
int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int n;
	cin >> n;
	stack<int> q;
	q.push(0);
	for (int i = 1;  i<= n; i++){
		cin >> a[i];
		while (!q.empty() && a[q.top()] > a[i])
		{
			q.pop();
		}
		b[i] = q.top();
		q.push(i);
	}
	long long ans = 0;
	for (int i = 1; i <= n; i++){
		dp[i] = dp[b[i]] + 1ll*a[i]*(i - b[i]);
		ans += dp[i];		
	}
        cout<< ans;
		
}