Submission #6110

#	Time	Username	Problem	Language	Result	Execution time	Memory
6110		kriii	즐거운 채소 기르기 (JOI14_growing)	C++98	45 / 100	1000 ms	4720 KiB

growing

#include <stdio.h>
#include <stack>
using namespace std;

int N,D[300030],L[300030],R[300030];
stack<pair<int, int> > S; int lf;

int main()
{
	scanf ("%d",&N);
	for (int i=0;i<N;i++) scanf ("%d",&D[i]);
	for (int i=0;i<N;i++){
		for (int j=0;j<i;j++) if (D[i] < D[j]) L[i]++;
	}

	for (int i=N-1;i>=0;i--){
		for (int j=i+1;j<N;j++) if (D[i] < D[j]) R[i]++;
	}

	long long ans = 0;
	for (int i=0;i<N;i++) ans += L[i] < R[i] ? L[i] : R[i];

	printf ("%lld\n",ans);

	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 15 / 15
• Subtask 4: 0 / 55