Pagini recente » Cod sursa (job #2415250) | Cod sursa (job #74069) | Cod sursa (job #1465306) | Cod sursa (job #1805813) | Cod sursa (job #1685830)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("reconst.in");
ofstream g("reconst.out");
int head,tail,n,m,suma,a[2010],sf[2010];
void interval_inclus(int head,int tail,int suma)
{
if(sf[head]==0){sf[head]=tail;a[head]=suma;} else
if(sf[head]<tail)interval_inclus(sf[head]+1,tail,suma-a[head]); else
if(sf[head]>tail){interval_inclus(tail+1,sf[head],a[head]-suma);sf[head]=tail; a[head]=suma;}
}
int main()
{
f>>n>>m; int i,j;
for(i=1;i<=m;i++){f>>head>>tail>>suma; interval_inclus(head,tail,suma);}
for(i=n;i>=1;i--)for(j=i+1;j<=sf[i];j++)a[i]-=a[j];
for(i=1;i<=n;i++)g<<a[i]<<" ";
return 0;
}