C++(clang++11) 解法, 执行用时: 15ms, 内存消耗: 380K, 提交时间: 2021-01-30 13:11:54

#include<stdio.h>
long long n,cnt=0,s,a,b; 
int main()
{
	scanf("%lld",&n);
	s=0;
	b=0;
	for (long long i=1;i<=n;i++)
	{
		scanf("%lld",&a);
		if (a>=b) s++;
		else s=1;
		b=a;
		cnt+=s;
	}
	printf("%lld\n",cnt);
	return 0;
} 

pypy3(pypy3.6.1) 解法, 执行用时: 127ms, 内存消耗: 30460K, 提交时间: 2021-01-31 18:14:33

def f(n):
    return (n * (1 + n)) // 2


n = int(input())
a = list(map(int, input().split()))
t, ans = 0, 0
for i in range(n):
    if i == n - 1 or a[i] > a[i + 1]:
        ans += f(i - t + 1)
        t = i + 1
print(ans)

C(clang11) 解法, 执行用时: 23ms, 内存消耗: 1084K, 提交时间: 2021-01-31 11:59:09

#include<stdio.h> 
int main()
{
	long long n,i,s=0,a,b=0,S=0;
	scanf("%lld",&n);
	for(i=0;i<n;i++)
	{
		scanf("%lld",&a);
		if (a>=b) s++;
		else s=1;
		b=a;
		S+=s;
	}
	printf("%lld\n",S);
	return 0;
} 

Python3(3.9) 解法, 执行用时: 115ms, 内存消耗: 15368K, 提交时间: 2021-02-14 11:02:34

input()
ar = [0] + list(map(int, input().split()))
dp = ar.copy()
for i in range(1, len(ar)):
    if ar[i] >= ar[i-1]:
        dp[i] = dp[i-1]+1
    else:
        dp[i] = 1
print(sum(dp))