C :

#include<stdio.h>
int main()
{
    int n;
	scanf("%d",&n);
	int a[n],i;
	for(i=0;i<n;i++){
		scanf("%d",&a[i]);
	}
	int max=a[0],x=0;
	int min=a[0],y=0;
	for(i=0;i<n;i++){
		if(a[i]>max){
				max=a[i];
				x=i;
			}else if(a[i]<min){
				min=a[i];
				y=i;
			}
    }
       printf("%d %d",x+1,y+1);
return 0;
}

C++ :

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

int main(){
	int a[1000],n,i,max = 0,min = 0;
	cin>>n;
	for(i = 0;i < n;i++){
		cin>>a[i];
		if(a[i] > a[max]){
			max = i;
		}
		
		if(a[i] < a[min]){
			min = i;
		}
	}
	
	cout<<max + 1<<" "<<min + 1<<endl;
}

Pascal :

var max,min,i,n:longint;
a:array[1..10000] of longint;
begin
read(n);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
if a[i]>max then max:=a[i];
min:=100000;
for i:=1 to n do
if a[i]<min then min:=a[i];
for i:=1 to n do
if max=a[i] then begin write(i,' ');break;end;
for i:=1 to n do
if a[i]=min then begin write(i);break;end;
end.

Java :

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);
	       int n = sc.nextInt();
	       int[] a = new int[n];
	       for(int i=0;i<n;i++){
	           a[i] = sc.nextInt();
	       }
	       getIndex(a);

	}
	public static void getIndex(int[] a){
		int max = a[0];int min = a[0];int index = 0;int index1 = 0;
		for(int i = 0;i<a.length;i++){
			if(max <a[i]){
				max = a[i];
				index = i+1;
			}else if(min >= a[i]){
				min = a[i];
				index1 = i+1;
			}
		}
		System.out.println(index + " " + index1);
	}

}

Python :

n=int(input())
a=input().split()
a=list(map(int,a))
da=max(a)
dai=a.index(da)+1
xiao=min(a)
xiaoi=a.index(xiao)+1
print(dai,xiaoi)