NEFU 2016省赛演练一 I题 (模拟题)

2023-11-22 22:02:31

这题没名字

Problem:I

Time Limit:2000ms

Memory Limit:65535K

Description

Now give you an interger m and a sequence: s[1], s[2], ...... , s[N] in not decreasing order. The length of the sequence is n. Your task is to find out how many pair of a and b satisfy a+b=m. Note that each element of the sequence can use once at most.

Input

The input consists of multiple test cases. The first line of each test case contains three integers N（0     Output
   For each case, output the num of pairs in one line.
     Sample Input
   3 3
1 1 2
3 2
1 1 1
5 5
1 1 2 3 4
     Sample Output
   1
1
2

题意：给定n和m，输入n个数，判断在这些数中有多少组两个数的和为m。
题解：用while跑是最快的，跑n存在风险，跑数组可能超时，跑m一定超时。
  #include 
#include 
#include <string.h>
#include 
#include 
using namespace std;
typedef long long ll;
ll a[1000005];
int main()
{ll i,n,m,data;while(scanf("%lld%lld",&n,&m)!=EOF){memset(a,0,sizeof(a));for(i=0;i)scanf("%lld",&a[i]);ll ans=0;sort(a,a+n);ll l=0,r=n-1;while(l<r){if(a[l]+a[r]>m)r--;else if(a[l]+a[r]<m)l++;else{ans++;r--;l++;}}printf("%lld\n",ans);}return 0;
}
      
 
转载于:https://www.cnblogs.com/Ritchie/p/5401642.html
                        
                        
本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！