HDU 5273
来源:互联网 发布:银行网络银行现状 编辑:程序博客网 时间:2024/05/21 09:56
Dylans loves sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 55 Accepted Submission(s): 31
Problem Description
Dylans is given N numbers a[1]....a[N]
And there are Q questions.
Each question is like this (L,R)
his goal is to find the “inversions” from number L to number R.
more formally,his needs to find the numbers of pair(x,y),
that L≤x,y≤R and x<y and a[x]>a[y]
Input
In the first line there is two numbers N and Q.
Then in the second line there are N numbers:a[1]..a[N]
In the next Q lines,there are two numbers L,R in each line.
N≤1000,Q≤100000,L≤R,1≤a[i]≤231−1
Output
For each query,print the numbers of "inversions”
Sample Input
3 2
3 2 1
1 2
1 3
Sample Output
1
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 55 Accepted Submission(s): 31
Problem Description
Dylans is given N numbers a[1]....a[N]
And there are Q questions.
Each question is like this (L,R)
his goal is to find the “inversions” from number L to number R.
more formally,his needs to find the numbers of pair(x,y),
that L≤x,y≤R and x<y and a[x]>a[y]
Input
In the first line there is two numbers N and Q.
Then in the second line there are N numbers:a[1]..a[N]
In the next Q lines,there are two numbers L,R in each line.
N≤1000,Q≤100000,L≤R,1≤a[i]≤231−1
Output
For each query,print the numbers of "inversions”
Sample Input
3 2
3 2 1
1 2
1 3
Sample Output
1
3
//由于N只有1000,所以先打表。。。感觉自己好笨 打表想了好久 。。唉
#include <stdio.h>#include <algorithm>using namespace std;int c[1010][1010]={{0}};int arr[1010]={9999999};int main(){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) scanf("%d",&arr[i]); int a,b; for(int i=999;i>=0;i--) //计算每个i-k 有多少组 { int cnt=0; for(int k=i+1;k<=1000;k++) { if(arr[i]>arr[k]) cnt++; c[i][k]=c[i+1][k]+cnt; //c[i][k]=c[i+1][k]+cnt[k] } } while(m--) { scanf("%d%d",&a,&b); printf("%d\n",c[a][b]); } return 0;}
0 0
- HDU 5273
- HDU 5273 区间DP
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- php面向对象基本概念(Final关键字)
- java实现七种排序 (插入排序, 希尔排序, 插入排序, 快速排序, 简单选择排序, 堆排序, 归并排序)
- Node.js基础一 环境配置、JS基础、创建WebSite
- Bootstrap里的文件作用
- 【初始化块】 类里的第4种成员(除Field、方法和构造器)
- HDU 5273
- 哈夫曼树的建立 源程序+注释+运行结果
- Stars(一定要看,树状数组差点问线问题)
- cocos2d-x 菜鸟实习生学习篇-菜单坐标
- POJ水题1083区间重叠问题
- Rails遗留数据库访问之一动态ORM
- leetcode--Minimum Size Subarray Sum
- 线性表子系统
- OpenCV实现图像搜索引擎(Image Search Engine)