제출 #570197

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
570197		juliocesar97	Mountains (NOI20_mountains)	C++14	0 / 100	2089 ms	2516 KiB

Mountains

/*
y = station
x and y = reciving stations
order = x.y.z
x and z shorter than mountain y
*/

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

int main(){
long long n;
long long cont1=0;
long long cont2=0;
long long ans1=0;
long long ans2 = 0;
cin>>n;
long long v[n];

for(int i=0; i<n; i++){
cin>>v[i];
}




for(int i=1; i<n; i++){



for(int j=0; j<i; j++){
if(v[i] > v[j]){
cont1 += 1;	}
}
for(int k=n; k>i; k--){
if(v[i] > v[k]){
cont2 +=1;	
ans1 = cont1*cont2;}
}


ans2 += ans1;



cont1 =0; 
cont2=0;
ans1=0;

}

//cout<<"program compiled, output: "<<ans2;
cout<<ans2;






return 0;
}

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 9
• Subtask 4: 0 / 36
• Subtask 5: 0 / 28
• Subtask 6: 0 / 9
• Subtask 7: 0 / 12