UVA 11584(p275)----Partitioning by Palindromes

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1000;
struct point
{
int v,k,c,l;
};
int d[maxn+50];
int n,cnt[maxn+50];
point g[maxn+50];
int cmp(point a,point b)
{
return a.v<b.v;
}
void solve()
{
cnt[0]=g[0].l;
for(int i=1; i<n; i++)
cnt[i]=cnt[i-1]+g[i].l;
for(int i=0; i<n; i++)
for(int j=0; j<=i; j++)
{
if(j==0)
d[i]=cnt[i]*g[i].c+g[i].k;
else
d[i]=min(d[i],d[j]+(cnt[i]-cnt[j])*g[i].c+g[i].k);
}
printf("%d\n",d[n-1]);
}
int main()
{
while(scanf("%d",&n)==1&&n)
{
memset(d,0,sizeof(d));
for(int i=0; i<n; i++)
scanf("%d%d%d%d",&g[i].v,&g[i].k,&g[i].c,&g[i].l);
sort(g,g+n,cmp);
solve();
}
return 0;
}