Cod sursa(job #1315856)
| Utilizator | Data | 13 ianuarie 2015 10:45:24 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
long a[30000][30000];
long x, n,ind1,ind2,maxim=0,i,j;
int main()
{ f>>n;
for(i=1;i<=n;i++)
{ f>>x;
a[i][i]=x;
}
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;
}
}
g<<maxim<<" "<<ind1<<" "<<ind2;
return 0;
}
