标签:ch participant Polycarp had Sorting were Cards points
技巧:
- 有负数,要用数组就统一加一个大的数(更具题目)map可能会影响时间
- 对于本题牢牢利用每一个值不一样,
Polycarp watched TV-show where k jury members one by one rated a participant by adding him a certain number of points (may be negative, i. e. points were subtracted). Initially the participant had some score, and each the marks were one by one added to his score. It is known that the i-th jury member gave ai points. Polycarp does not remember how many points the participant had before this k marks were given, but he remembers that among the scores announced after each of the k judges rated the participant there were n (n ≤ k) values b1, b2, ..., bn (it is guaranteed that all values bj are distinct). It is possible that Polycarp remembers not all of the scores announced, i. e. n < k. Note that the initial score wasn't announced. Your task is to determine the number of options for the score the participant could have before the judges rated the participant. Input The first line contains two integers k and n (1 ≤ n ≤ k ≤ 2 000) — the number of jury members and the number of scores Polycarp remembers. The second line contains k integers a1, a2, ..., ak ( - 2 000 ≤ ai ≤ 2 000) — jury's marks in chronological order. The third line contains n distinct integers b1, b2, ..., bn ( - 4 000 000 ≤ bj ≤ 4 000 000) — the values of points Polycarp remembers. Note that these values are not necessarily given in chronological order. Output Print the number of options for the score the participant could have before the judges rated the participant. If Polycarp messes something up and there is no options, print "0" (without quotes). Sample 1 Inputcopy Outputcopy 4 1 -5 5 0 20 10 3 Sample 2 Inputcopy Outputcopy 2 2 -2000 -2000 3998000 4000000 1 Note The answer for the first example is 3 because initially the participant could have - 10, 10 or 15 points. In the second example there is only one correct initial score equaling to 4 002 000.View problem
#include <bits/stdc++.h> using namespace std; #define ri register int #define M 10005 template <class G> void read(G &x) { x=0;int f=0;char ch=getchar(); while(ch<'0'||ch>'9'){f|=ch=='-';ch=getchar();} while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();} x=f?-x:x; return ; } int n,m,md; int p[M],a[M]; int main(){ read(n);read(m);read(md); for(ri i=1;i<=n;i++) read(p[i]); for(ri j=1;j<=m;j++) read(a[j]); sort(p+1,p+1+n); sort(a+1,a+1+m); long long ans=1e18; for(ri i=1;i<=(m-n+1);i++) { long long tmp=0; for(ri j=1;j<=n;j++) { long long aa=abs(p[j]-a[i+j-1])+abs(a[i+j-1]-md);tmp=max(tmp,aa); } ans=min(ans,tmp); } printf("%lld",ans); return 0; }View Code
标签:ch,participant,Polycarp,had,Sorting,were,Cards,points 来源: https://www.cnblogs.com/Lamboofhome/p/15973015.html
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。