CodeForces 670C Cinema
2016-09-23 12:33
267 查看
简单题。
统计一下懂每种语言的人分别有几个,然后$O(n)$扫一遍电影就可以得到答案了。
统计一下懂每种语言的人分别有几个,然后$O(n)$扫一遍电影就可以得到答案了。
#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<iostream> using namespace std; typedef long long LL; const double pi=acos(-1.0),eps=1e-6; void File() { freopen("D:\\in.txt","r",stdin); freopen("D:\\out.txt","w",stdout); } template <class T> inline void read(T &x) { char c=getchar(); x=0; while(!isdigit(c)) c=getchar(); while(isdigit(c)) {x=x*10+c-'0'; c=getchar();} } const int maxn=200010; int a[maxn],b[maxn],c[maxn],n,q; map<int,int>m; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) {int x; scanf("%d",&x),m[x]++; } scanf("%d",&q); for(int i=1;i<=q;i++) scanf("%d",&b[i]); for(int i=1;i<=q;i++) scanf("%d",&c[i]); for(int i=1;i<=q;i++) b[i]=m[b[i]],c[i]=m[c[i]]; int mx=0; for(int i=1;i<=q;i++) mx=max(mx,b[i]); int ans=0; for(int i=1;i<=q;i++) { if(b[i]!=mx) continue; if(c[i]<c[ans]) continue; ans=i; } printf("%d\n",ans); return 0; }
相关文章推荐
- codeforces290 A.Fox And Names
- CodeForces 628 C C - Bear and String Distance
- CodeForces 414D (贪心)
- CodeForces - 803C Maximal GCD(贪心)
- codeforces 920 E.Connected Components?
- codeforces 30C Shooting Gallery (概率dp)
- codeforces 630P. Area of a Star
- 【codeforces】Hulk
- codeforces 837 C
- Codeforces 30E Tricky and Clever Password-字符串匹配
- codeforces 119C Education Reform (dp+路径打印)
- codeforces 632F. Magic Matrix (最小生成树)
- Codeforces 676 C Vasya and String【二分查找+预处理】
- Problem--231A--Codeforces--Team
- [题解] CodeForces 429B Working out
- CodeForces 198B Jumping on Walls(bfs || dfs)
- SEU寒假训练题解二 I Codeforces 432E
- Codeforces 632C The Smallest String Concatenation 【string】
- CodeForces 701A Cards(水水的玩扑克)
- 【CodeForces】500B - New Year Permutation(Floyd)(贪心)