pog loves szh II
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2346 Accepted Submission(s): 677
Problem Description
Pog and Szh are playing games.There is a sequence with
n
numbers, Pog will choose a number A from the sequence. Szh will choose an another number named B from the rest in the sequence. Then the score will be
(A+B)
mod
p
.They hope to get the largest score.And what is the largest score?
Input
Several groups of data (no more than
5
groups,
n≥1000
).
For each case:
The following line contains two integers, n(2≤n≤100000) , p(1≤p≤231−1) 。
The following line contains n integers ai(0≤ai≤231−1) 。
For each case:
The following line contains two integers, n(2≤n≤100000) , p(1≤p≤231−1) 。
The following line contains n integers ai(0≤ai≤231−1) 。
Output
For each case,output an integer means the largest score.
Sample Input
4 4 1 2 3 0 4 4 0 0 2 2
Sample Output
3 2
题目链接:点击打开链接
对每个读入的数去p的模, 排序下, 扫一遍数组, 对每个数, 从后向前遍历, 直到等于当前数时break掉, 如果没有找到最大, 那就用最后一
个数加前面的求最大即可.
AC代码:
#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
#include "queue"
#include "stack"
#include "cmath"
#include "utility"
#include "map"
#include "set"
#include "vector"
#include "list"
#include "string"
#include "cstdlib"
using namespace std;
typedef long long ll;
#define X first
#define Y second
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 5;
ll n, p, a[MAXN];
int main(int argc, char const *argv[])
{
while(scanf("%lld%lld", &n, &p) != EOF) {
for(int i = 0; i < n; ++i) {
scanf("%lld", &a[i]);
a[i] %= p;
}
sort(a, a + n);
int j = n - 1;
ll ans = 0;
for(int i = 0; i < n; ++i) {
while(j > i && a[j] + a[i] >= p) --j;
if(j == i) break;
ans = max(ans, a[i] + a[j]);
}
for(int i = 0; i < n - 1; ++i)
ans = max(ans, (a[i] + a[n - 1]) % p);
printf("%lld\n", ans);
}
return 0;
}