Cod sursa(job #1348224)
| Utilizator | Data | 19 februarie 2015 16:18:54 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int v[6000000], sp[6000000];
int main()
{ int n, i, j, s,mx=-99999999, mx1, mx2;
f>>n;
for (i=1;i<=n;i++)
{ f>>v[i];
sp[i]=sp[i-1]+v[i];
}
for (i=1;i<=n;i++)
for(j=i;j<=n;j++)
{ s=sp[j]-sp[i-1];
if (s>mx) { mx=s; mx1=i; mx2=j; }
}
g<<mx<<' '<<mx1<<' '<<mx2;
return 0;
}
