Pagini recente » Cod sursa (job #2961276) | Cod sursa (job #1410100) | Cod sursa (job #158420) | Cod sursa (job #448261) | Cod sursa (job #279744)
Cod sursa(job #279744)
#include<fstream.h>
int main()
{int X, Y, Z, S, min=30003, i, j, n, a, b, c ,d, e, h, t, v[30000];
ifstream f("secv.in");
ofstream g("secv.out");
f>>n;
for (t=1; t<=n; t++)
f>>v[t];
i=1;
a=1;
while (1)
{
X=-10001;
for (a=1; a<=i; a++)
if (v[a]>X) X=v[a];
j=i+1;
b=1;
while (b<=n-2)
{
Y=-10001;
for (b=i+1; b<=j; b++)
if (v[b]>Y) Y=v[b];
c=1;
while (c<=n-1)
{Z=-10001;
for (c=j+1; c<=n; c++)
if (v[c]>Z) Z=v[c];
}
S=X+Y+Z;
if (S<min) {min=S; e=i; h=j;}
j++;
}
i++;
if (i==n-1) break;
}
g<<min<<"\n"<<e<<" "<<h;
f.close();
g.close();
return 0;
}