ural 1613
2012-09-08 10:32
92 查看
题目:http://acm.timus.ru/problem.aspx?space=1&num=1613
题意:给出N 个数,然后给出询问区间,并给出询问的数,问这个数是不是存在
hash还是很好想的,然后如果再能想到优化,就没问题了
View Code
题意:给出N 个数,然后给出询问区间,并给出询问的数,问这个数是不是存在
hash还是很好想的,然后如果再能想到优化,就没问题了
View Code
typedef long long ll; const int N = 100008; const int mod = 100007; struct node { int data; int id; }; vector<node>mark ; int a ; int main() { int i; int n,q; int s,e,x; node tem; //freopen("data.txt","r",stdin); while(scanf("%d",&n) != EOF) { for(i = 1; i <= n; i++) { scanf("%d",&x); a[i] = x; // 预存这些数 tem.data = x; tem.id = i; mark[x % mod].push_back(tem); } scanf("%d",&q); while(q--) { scanf("%d%d%d",&s,&e,&x); //cout<<"a[x] = "<<a[s]<<endl; if(a[s] == x || a[e] == x) // 首先判断一下,就是这个优化,如果不加就是 TLE 了 { printf("1"); continue; } int flag = 0; int temp = x % mod; int kem = mark[temp].size(); for(i = 0; i < kem; i ++) { if(mark[temp][i].data == x && mark[temp][i].id >= s && mark[temp][i].id <= e) { flag = 1; break; } } if(flag) printf("1"); else printf("0"); } printf("\n"); } return 0; }
相关文章推荐
- ural 1613 For Fans of Statistics
- ural 1613【hash+二分】
- URAL 1613 For Fans of Statistics
- Ural 1613 For Fans of Statistics(vector应用)
- Ural1613-For Fans of Statistics
- Ural 1613-For Fans of Statistics(vector)
- URAL 1145. Rope in the Labyrinth(两次BFS啊 )
- ural 1145 Rope in the Labyrinth 图中 bfs求树的直径
- URAL 1830 Help in the RNOS 思路,读题 难度:1
- Ural1225(数学)
- HLG 1613 迷宫问题 (BFS + priority_queue)
- URAL 1294. Mars Satellites(余弦定理 数学啊 )
- URAL 1293. Eniya
- URAL 1987. Nested Segments(数学 & 线段树)
- URAL 1826. Minefield 贪心
- URAL 1880. Psych Up's Eigenvalues
- URAL 1613. For Fans of Statistics 二分+stl
- URAL 1114 Boxes (dp)
- URAL - 1009 - K-based Numbers (简单DP)
- [ural1519]Formula 1 && 插头DP(括号表示法)