Pagini recente » Cod sursa (job #895162) | Cod sursa (job #756568) | Cod sursa (job #1392934) | Cod sursa (job #1307454) | Cod sursa (job #1315850)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
int a[100][100];
int n,ind1,ind2,maxim=0;
int x,i,j;
int main()
{ f>>n;
for(i=1;i<=n;i++)
{ f>>x;
a[i][i]=x;
}
int nr=0;
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{a[i][j]=a[i][j-1]+a[j][j];
if(a[i][j]>maxim) {
maxim=a[i][j];
ind1=i;ind2=j;
}
nr++;
}
cout<<maxim<<" "<<ind1<<" "<<ind2<<endl<<nr;
return 0;
}