42 lines
1004 B
C++
42 lines
1004 B
C++
|
#include <bits/stdc++.h>
|
|||
|
|
using namespace std;
|
|||
|
|
typedef long long LL;
|
|||
|
|
const LL INF = 1e17;
|
|||
|
|
const int N = 1e6 + 10;
|
|||
|
|
int n, p;
|
|||
|
|
LL a[N]; // ÿ<><C3BF>С<EFBFBD><D0A1><EFBFBD>ѵ<EFBFBD><D1B5><EFBFBD><EFBFBD><EFBFBD>(<28><><EFBFBD><EFBFBD>)
|
|||
|
|
LL b[N]; // ÿ<><C3BF>С<EFBFBD><D0A1><EFBFBD>ѵ<EFBFBD><D1B5><EFBFBD><EFBFBD><EFBFBD>(֮ǰ<D6AE><C7B0><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӷκ<D3B6>)
|
|||
|
|
LL c[N]; // ÿ<><C3BF>С<EFBFBD><D0A1><EFBFBD>ѵķ<D1B5><C4B7><EFBFBD>(c[1]=b[1]<5D><>c[i]=c[k]+b[k])
|
|||
|
|
int main() {
|
|||
|
|
// <20>ӿ<EFBFBD><D3BF><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
ios::sync_with_stdio(false), cin.tie(0);
|
|||
|
|
// <20><><EFBFBD><EFBFBD>
|
|||
|
|
cin >> n >> p;
|
|||
|
|
for (int i = 1; i <= n; i++)
|
|||
|
|
cin >> a[i];
|
|||
|
|
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ӷκ<D3B6>
|
|||
|
|
b[0] = -INF;
|
|||
|
|
LL sum = 0;
|
|||
|
|
for (int i = 1; i <= n; i++) {
|
|||
|
|
sum += a[i];
|
|||
|
|
b[i] = max(b[i - 1], sum);
|
|||
|
|
sum = max(sum, (LL)0);
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
c[1] = b[1];
|
|||
|
|
c[2] = c[1] + b[1];
|
|||
|
|
for (int i = 3; i <= n; i++) {
|
|||
|
|
c[i] = max(c[i - 1], c[i - 1] + b[i - 1]);
|
|||
|
|
if (c[i] > c[1]) // ע<><D7A2><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
c[i] %= p;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
if (c[1] > 0) // <20><><EFBFBD><EFBFBD><EFBFBD>Dz<EFBFBD><C7B2>½<EFBFBD><C2BD><EFBFBD>,<2C><>c[1]>0ʱ<30><CAB1>c[n]>c[1]
|
|||
|
|
cout << c[n] % p;
|
|||
|
|
else
|
|||
|
|
cout << max(c[n], c[1]) % p;
|
|||
|
|
return 0;
|
|||
|
|
}
|