hdu 1394 Minimum Inversion Number
2012-07-14 00:03
316 查看
求最少逆序是多少,推荐用线段树,但暴力也能过,我用的方法两者皆非。我只是用暴力求第一种排列的逆序数,剩下的用小技巧推出。
#include <iostream> using namespace std; int a[5010]; int main() { int n,i,j,ans,min; while(cin>>n) { for(i = 0; i < n; i++) cin>>a[i]; ans = 0; for(i = 0; i < n-1; i++) for(j = i+1; j < n; j++) if(a[j] < a[i]) ans++; min = ans; for(i = 0; i < n-1; i++) { ans = ans+n-1-2*a[i]; if(ans < min) min = ans; } cout<<min<<endl; } return 0; }
相关文章推荐
- hdu 1394 Minimum Inversion Number(树状数组求逆序数)
- hdu 1394 Minimum Inversion Number
- hdu 1394 Minimum Inversion Number 线段树 逆序数
- HDU-1394-Minimum Inversion Number
- hdu 1394 Minimum Inversion Number 树状数组+递推
- Minimum Inversion Number HDU-1394
- hdu 1394/哈理工oj 1250 Minimum Inversion Number【线段树过】
- Minimum Inversion Number(hdu1394(线段数or暴力))
- hdu 1394 Minimum Inversion Number - 树状数组
- HDU 1394 Minimum Inversion Number
- hdu 1394 Minimum Inversion Number(树状数组)
- Hdu 1394 Minimum Inversion Number
- hdu 1394 Minimum Inversion Number
- hdu 1394 Minimum Inversion Number(线段树之 单点更新求逆序数)
- HDU 1394 Minimum Inversion Number
- HDU 1394 Minimum Inversion Number(树状数组||线段树)
- HDU 1394 Minimum Inversion Number
- Minimum Inversion Number hdu 1394
- hdu 1394 Minimum Inversion Number
- HDU ~ 1394 ~ Minimum Inversion Number(暴力||归并排序||线段树||树状数组)