Submission #1231013

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()

#define REP(i, a, b) for(int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for(int i = (a); i <= (int)(b); i++)
#define FA(it, x) for(__typeof((x).begin()) it = (x).begin(); it != (x).end(); it++)
#define SZ(x) (int)(x).size()
#define BE(x) (x).begin(), (x).end()
#define SORT(x) sort(BE(x))
#define _1 first
#define _2 second

#define x1 gray_cat_x1
#define y1 gray_cat_y1

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }

#define file "cycle"

const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const ll MOD = 1e9 + 7;

const int MAXN = 2e5 + 5;

pii pp[MAXN];

map<int, int> segs;

void solve(){
	int n;
	scanf("%d", &n);
	REPN(i, 1, n){
		scanf("%d", &pp[i]._1);
		pp[i]._2 = i;
	}
	sort(pp + 1, pp + n + 1);
	ll ans = 0ll;
	segs[n] = 1;
	REPN(i, 1, n){
		int ind = pp[i]._2;
		pii cur_seg = *segs.lower_bound(ind);
		ans += (ll)pp[i]._1 * (ll)(ind - cur_seg._2 + 1) * (ll)(cur_seg._1 - ind + 1);
		segs.erase(cur_seg._1);
		if (cur_seg._1 > ind){
			segs[cur_seg._1] = ind + 1;
		}
		if (ind > cur_seg._2){
			segs[ind - 1] = cur_seg._2;
		}
	}
	printf("%lld\n", ans);
}	

int main(){

	//freopen(file".in", "r", stdin); freopen(file".out", "w", stdout);
	int t = 1;
	//cin >> t;
	while(t--){
		solve();	
	}
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:42:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:44:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &pp[i]._1);
                         ^

Judge Result