Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cmath>
- #include <cstdio>
- #include <vector>
- #include <iostream>
- #include <algorithm>
- #include <map>
- using namespace std;
- typedef pair<int, int> ii;
- long long nbRt[100001];
- int main()
- {
- ios_base::sync_with_stdio(false);
- //freopen("input.txt","r",stdin);
- int n,m ;
- long long count =0,cont=0;
- cin>>n>>m;
- long long tab[n];
- for(int i=0; i<n; i++) //O(n)
- cin>>tab[i];
- for(int j=0; j<m; j++) //O(m^2)
- for(int l=j+1; l<m; l++)
- if(tab[j]>tab[l])
- {
- nbRt[j]++;
- count++;
- cont++;
- }
- for(int i=1; i<=n-m; i++)//O(n*m)
- {
- cont-=nbRt[i-1];
- count+=cont;
- for(int j=i; j<i+m-1; j++)
- if((tab[j]>tab[i+m-1]))
- {
- count++;
- cont++;
- nbRt[j]++;
- }
- }
- cout<<count<<endl;
- return 0 ;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement