python codeforces 322 div2 C

#-*- encoding: utf-8 -*-
import sys
from operator import itemgetter

a = [[1100000000, 1100000000, 1100000000] for row in range(rows)]

b = []
n = raw_input();
n = (int)(n)
b = map(int, sys.stdin.readline().split())

for i in range(n):
    a[i][0] = i;
    a[i][2] = b[i];
    
def my_cmp(E1, E2):
    return cmp(E1[2], E2[2]) 

def cmp2(x ,y):
    if x[0] == y[0]:
        return cmp(x[1],y[1])
    return cmp(x[0], y[0])

a.sort(my_cmp) 

for i in range(n):
    a[i][1] = i
    if a[i][0] > a[i][1]:
        a[i][0], a[i][1] = a[i][1], a[i][0]

a.sort(cmp2)

l = a[0][0]
r = a[0][1]

ans = 1;

for i in range(1,n):
    #print a[i].x, r
    if a[i][0] > r:
        ans = ans + 1
        l = a[i][0]
        r = a[i][1]
    elif a[i][1] > r:
        r = a[i][1]

print ans