Pagini recente » Cod sursa (job #2853889) | Cod sursa (job #1007940) | Cod sursa (job #1681044) | Istoria paginii algoritmiada-2019/runda-maraton/solutii/palatulvoltaic | Cod sursa (job #67844)
Cod sursa(job #67844)
#include <stdio.h>
#define maxN 2010
#define fo(i,n) for(int i=0;i<n;i++)
int res;
int n,vec[maxN];
unsigned*din[maxN];
void inputFunc(){FILE*fi=fopen("psir.in","r");fscanf(fi,"%d",&n);for(int i=0;i<n;i++)fscanf(fi,"%d",vec+i);fclose(fi);}void outputFunc(){FILE*fi=fopen("psir.out","w");fprintf(fi,"%u",res);fclose(fi);}
int main(){
inputFunc();
fo(i,n){
int cur=vec[i];din[i]=new unsigned[i];
fo(j,i){
din[i][j]=1;
if(cur>vec[j]){
fo(g,j){
if(vec[g]>cur)din[i][j]+=din[j][g];
}
}else
if(cur<vec[j]){
fo(g,j){
if(vec[g]<cur)din[i][j]+=din[j][g];
}
}
res+=din[i][j];
}
}
outputFunc();
return 0;
}