Submission #1183653

#TimeUsernameProblemLanguageResultExecution timeMemory
1183653soykDischarging (NOI20_discharging)C++20
11 / 100
430 ms8628 KiB
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;

int main()
{
	int N;
	cin >> N;
	long long int* arr = (long long int*)malloc(sizeof(long long int) * N);
	long long int max=0,count=0,sum=0;
	for (int a = 0; a < N; a++)
	{
		cin >> arr[a];
		if (arr[a] > max)
		{
			if (count * (arr[a] - max) < (N - a) * max)
				sum += count * (arr[a] - max);
			else
			{
				sum += (N - a) * max;
				count = 0;
			}
			max = arr[a];
		}
		count++;
		sum += max;
	}
	cout << sum;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...