分糖果

#include <stdio.h>
#include <stdlib.h>

int main()
{
int n = 0, j;
int *p = 0, *q = 0;
int t = 0;

scanf("%d", &n);
p = (int *)calloc(n, sizeof(int));
q = (int *)calloc(n, sizeof(int));
for (j = 0; j < n; j++)
{
scanf("%d", &p[j]);
}

q[0] = 1;
for (j = 1; j < n; j++)
{
if (p[j] <= p[j - 1])
q[j] = 1;
else
q[j] = q[j - 1] + 1;
}
for (j = n - 2; j >= 0; j--)
{
if (p[j] > p[j + 1] && q[j] <= q[j + 1])
q[j] = q[j + 1] + 1;
}

for (j = 0; j < n; ++j)
{
t += q[j];
}
printf("\n%d\n", t);
return 0;
}