http://codeforces.com/contest/1141/problem/C
题意:给n-1个差值,p[i]=a[i+1]-a[i];问是否能构造出n的一个排列;
思路:设首个数为x,则为x+p[1],x+p[1]+p[2],x+p[1]+p[2]+p[3]....(p[1]先设0);得到sum数组,sum数组一定就是n个数排列,且差值为1,所以对应的位置分别就是sum排列好的位置的数字;
总结:数学方面不行啊,没想到设未知数的思想!!!
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);endl '\n'
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=998244353;
template <class T>
inline void sc(T &ret)
{
char c;
ret = 0;
while ((c = getchar()) < '0' || c > '9');
while (c >= '0' && c <= '9')
{
ret = ret * 10 + (c - '0'), c = getchar();
}
}
ll power(ll x,ll n)
{
ll ans=1;
while(n)
{
if(n&1) ans=ans*x%mod;
x=x*x%mod;
n>>=1;
}
return ans;
}
int ans[maxn],sum[maxn],p[maxn];
map<int,int> mp;
int main()
{
int n;
cin>>n;
sum[1]=0;
mp[0]=1;
for(int i=2;i<=n;i++)
{
cin>>p[i];
sum[i]=sum[i-1]+p[i];
mp[sum[i]]=i;
}
sort(sum+1,sum+n+1);
bool f=1;
for(int i=1;i<n;i++)
{
//cout<<sum[i]<<" ";
if(sum[i]+1!=sum[i+1])
{
f=0;
break;
}
}
for(int i=1;i<=n;i++)
{
ans[mp[sum[i]]]=i;
}
if(!f)
{
cout<<-1<<endl;
}
else
{
for(int i=1;i<=n;i++)
{
cout<<ans[i]<<" ";
}
}
return 0;
}