Pagini recente » Monitorul de evaluare | Cod sursa (job #1586048) | Cod sursa (job #1105344) | Cod sursa (job #233492) | Cod sursa (job #285008)
Cod sursa(job #285008)
#include<iostream>
#include<stdio.h>
struct asd{int x,y;} a[2010];
int s[2010],b[2010],c[2010];
int sum[2010],sol[2010];
int main()
{
freopen("reconst.in","r",stdin);
freopen("reconst.out","w",stdout);
int n,m,i,a1,a2;
scanf("%d%d",&n,&m);
for(i=1;i<=m;i++)
scanf("%d%d%d",&a[i].x,&a[i].y,&s[i]);
for(i=1;i<=m;i++)
{
while(b[a[i].y]&&a[i].x<=a[i].y)
{
if(b[a[i].y]>=a[i].x)
s[i]-=c[a[i].y];
else
{
a1=b[a[i].y];
a2=c[a[i].y]-s[i];
c[a[i].y]=s[i];
b[a[i].y]=a[i].x;
a[i].x=a1;
s[i]=a2;
}
a[i].y=b[a[i].y]-1;
}
if(a[i].y>=a[i].x)
{
b[a[i].y]=a[i].x;
c[a[i].y]=s[i];
}
}
for(i=1;i<=n;i++)
{
if(b[i])
sol[i]=c[i]-sum[i-1]+sum[b[i]-1];
sum[i]=sum[i-1]+sol[i];
}
for(i=1;i<=n;i++)
printf("%d ",sol[i]);
return 0;
}