Cod sursa(job #1003917)
Utilizator | Data | 1 octombrie 2013 19:30:30 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int i,j,Max,Max1,Max2,h,n,a[6000003];
int main()
{
f>>n;Max1=Max2=1;
for(i=1;i<=n;++i) f>>a[i]; Max=1;
for(i=1;i<=n;++i)
{ h=a[i];
for(j=i+1;j<=n;++j)
{
h+=a[j];
if(h>Max) {Max=h;Max1=i;Max2=j;}
}
}
g<<Max<<" "<<Max1<<" "<<Max2<<'\n';
return 0;
}