VPARTSUM - Tổng bộ phận
Tác giả: ll931110
Ngôn ngữ: C++
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define INF 2000000001
typedef long long ll;
using namespace std;
set<int> s;
int n,k,p;
int a[100010];
int main()
{
// freopen("part.in","r",stdin);
// freopen("part.ou","w",stdout);
scanf("%d %d %d", &n, &k, &p);
for (int i = 0; i < n; i++) scanf("%d", &a[i]);
int ret = INF;
s.insert(-1); s.insert(INF); s.insert(0); int sum = 0;
for (int i = 0; i < n; i++)
{
set<int>::iterator iter;
sum = (sum + a[i]) % p;
if (sum >= k)
{
iter = s.upper_bound(sum - k); iter--;
if (*iter != -1) ret = min(ret,sum - *iter);
};
iter = s.upper_bound(sum + p - k); iter--;
if (*iter >= sum) ret = min(ret,sum + p - *iter);
s.insert(sum);
};
printf("%d\n", ret);
};