Pagini recente » Cod sursa (job #2964468) | Cod sursa (job #1647594) | Cod sursa (job #2951644) | Cod sursa (job #1749008) | Cod sursa (job #1829514)
#include <fstream>
using namespace std;
ifstream f("podm.in");
ofstream g("podm.out");
int n,i,j,d[510],a[505][505],d1[100],k,mini,j1;
int main()
{
f>>n;
/* for(j=2;j<=n;j++)
{for(i=1;i<=n-j+1;i++)
g<<i<<","<<j+i-1<<" ";
g<<endl;
}
*/
for(i=1;i<=n+1;i++)
f>>d[i];
for(i=1;i<=n-1;i++)
a[i][i+1]=d[i]*d[i+1]*d[i+2];
for(j=3;j<=n;j++)
{
for(i=1;i<=n-j+1;i++)
{
j1=j+i-1;
for(k=i;k<j1;k++)
d1[k]=a[i][k]+a[k+1][j1]+d[i]*d[k+1]*d[j1+1];
mini=d1[i];
a[j1][i]=i;
for(k=i;k<j1;k++)
if(d1[k]<mini)
{
mini=d1[k];
a[j1][i]=k;
}
a[i][j1]=mini;
}
}
/*
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<endl;
}
*/
g<<a[1][n];
f.close();
g.close();
return 0;
}