hiho week 136 register

Ended

Participants:181

Verdict:Accepted
Score:100 / 100
Submitted:2017-02-07 09:59:56

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include<stdio.h>
long long p[100010];
long long b[100010];
long long n;
long long q;
long long q0,q1,q2;
long long k0,k1,k2;
long long swap(long long &x,long long &y)
{
    long long i,j,k,l;
    i=x;
    x=y;
    y=i;
    return 0;
}
long long SP(long long x)
{
    long long i,j,k,l,y;
    long long sp;
    long long ot[100000];
    for(i=1;i<=x;i++)
    {
        b[i]=p[i];
        j=i;
        while(j>1 && b[j]>b[j/2])
        {
            swap(b[j],b[j/2]);
            j=j/2;
        }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX