题目大意:
构造一个
n
n
n 项数列其和为
s
s
s 相邻项满足
a
i
−
a
i
+
1
=
k
a_i-a_{i+1}=k
ai−ai+1=k 或
a
i
+
1
−
a
i
=
1
a_{i+1}-a_i=1
ai+1−ai=1
题目分析:
首先,只要确定了
a
i
a_i
ai ,就可以确定
∑
i
=
1
n
a
i
m
o
d
(
k
+
1
)
∑_{i=1}^na_i\ mod(k+1)
∑i=1nai mod(k+1) 的值
证明:
我们先分两种情况考虑:
- 只考虑 a i + 1 − a i = 1 a_{i+1}-a_i=1 ai+1−ai=1 的情况,此时 ∑ i = 1 n a i = n a 1 + ( n − 1 ) n 2 ∑_{i=1}^na_i=na_1+\frac{(n-1)n}2 i=1∑nai=na1+2(n−1)n
- 再加上
a
i
−
a
i
+
1
=
k
a_i-a_{i+1}=k
ai−ai+1=k 的情况,此时就是在第一种的情况上减去了多个
k
+
1
k+1
k+1
∑ i = 1 n a i = n a 1 + ( n − 1 ) n 2 − x ( k + 1 ) ( x ≥ 0 ) ∑_{i=1}^na_i=na_1+\frac{(n-1)n}2-x(k+1)\ \ (x\ge0) i=1∑nai=na1+2(n−1)n−x(k+1) (x≥0)
于是我们可以枚举
a
1
a_1
a1 ,因为对于每一个确定的
a
i
m
o
d
(
k
+
1
)
a_i\ mod(k+1)
ai mod(k+1) ,可以
O
(
1
)
O(1)
O(1) 确定
∑
i
=
1
n
a
i
m
o
d
(
k
+
1
)
\sum_{i=1}^na_i\ mod(k+1)
∑i=1nai mod(k+1) ,这时构造的数列是这样的:
a
1
,
a
1
+
1
,
.
.
.
k
.
0
,
1
,
.
.
.
,
k
,
0
,
1
,
.
.
.
a_1,a_1+1,...k.0,1,...,k,0,1,...
a1,a1+1,...k.0,1,...,k,0,1,...
因此我们可以通过枚举
a
1
a_1
a1 来求出
m
i
n
∑
i
=
1
n
a
i
min\sum_{i=1}^na_i
min∑i=1nai
当可以构造出符合题意的数列事其一定满足下列条件:
- m i n ∑ i = 1 n a i ≤ s min\sum_{i=1}^na_i \le s min∑i=1nai≤s
- s m o d ( k + 1 ) = ∑ i = 1 n a i m o d ( k + 1 ) s\ mod(k+1)=\sum_{i=1}^na_i\ mod(k+1) s mod(k+1)=∑i=1nai mod(k+1)
对条件2的理解:我们可以通过不断地在 m i n ∑ i = 1 n a i min\sum_{i=1}^na_i min∑i=1nai 上不断的加 k + 1 k+1 k+1 ,来使其满足 a i − a i + 1 = k a_i-a_{i+1}=k ai−ai+1=k 的同时使 ∑ i = 1 n a i \sum_{i=1}^na_i ∑i=1nai 接近 s s s 。
具体细节见代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
ll read()
{
ll res = 0,flag = 1;
char ch = getchar();
while(ch<'0' || ch>'9')
{
if(ch == '-') flag = -1;
ch = getchar();
}
while(ch>='0' && ch<='9')
{
res = (res<<3)+(res<<1)+(ch^48);//res*10+ch-'0';
ch = getchar();
}
return res*flag;
}
const int maxn = 1e5+5;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-8;
ll n,k,s,a[maxn],num[maxn],mina;
bool flag;
int main()
{
n = read(),k = read(),s = read();
if(n == 1)
{
printf("%lld\n",s);
return 0;
}
for(int i = 0;i <= k;i++) //枚举 a1
{
ll sum = k*(k+1)/2; // 每一块的和
ll block = (n-(k-i+1))/(k+1); // 块数
ll rem = n-(k-i+1)-block*(k+1); // 剩余位置
ll mina1 = min(k,i+n-1); //尾项
mina = sum*block+(mina1+i)*(mina1-i+1)/2;
if(rem > 0) mina += (rem-1)*rem/2; // 剩余块贡献
if(s >= mina && s%(k+1) == mina%(k+1))
{
flag = true;
a[1] = i;
break;
}
}
if(!flag)
{
puts("-1");
return 0;
}
num[a[1]]++;
for(int i = 2;i <= n;i++)
{
a[i] = (a[i-1]+1)%(k+1);
num[a[i]]++;
}
ll res = 0,cnt = (s-mina)/(k+1);
ll a = cnt%n,b = cnt/n;
int pos = -1;
for(int i = 0;i <= k;i++)
{
res += num[i];
if(res > a)
{
pos = i;
res = a-(res-num[i]);
break;
}
}
for(int i = 1;i <= n;i++)
{
if(::a[i] < pos)
::a[i] += (k+1)*(b+1);
else if(::a[i] > pos) ::a[i] += (k+1)*b;
else if(::a[i] == pos)
{
if(res > 0)
{
::a[i] += (k+1)*(b+1);
res--;
}
else ::a[i] += (k+1)*b;
}
}
for(int i = 1;i <= n;i++)
printf("%lld%c",::a[i],i==n ? '\n' : ' ');
return 0;
}