cf C. Insertion Sort

http://codeforces.com/contest/362/problem/C

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;

 int a[];
 int c[];
 int n;

 int lowbit(int x)
 {
     return x&(-x);
 }

 void add(int x)
 {
     while(x>)
     {
         c[x]++;
         x-=lowbit(x);
     }
 }

 int sum(int x)
 {
     int sum1=;
     while(x<=n)
     {
         sum1+=c[x];
         x+=lowbit(x);
     }
     return sum1;
 }

 int main()
 {
     while(scanf("%d",&n)!=EOF)
     {
         for(int i=; i<=n; i++)
         {
             scanf("%d",&a[i]);
             a[i]++;
         }
         int t1=,temp,t2=;
         int max1=-;
         for(int i=; i<n; i++)
         {
             memset(c,,sizeof(c));
             for(int j=i+; j<=n; j++)
             {
                 if(a[i]>a[j])
                 {
                     t1++;
                     temp=+*sum(a[j]);
                     if(temp>max1) {max1=temp; t2=;}
                     if(temp==max1) t2++;
                     add(a[j]);
                 }
             }
         }
         printf("%d %d\n",t1-max1,t2);
     }
     return ;
 }