Cod sursa(job #462279)
Utilizator | Tudorica Andrei DEYDEY2 | Data | 10 iunie 2010 11:58:15 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
long st,dr,n,i,x[6000001],max=0,max1=0,max2=0,s;
f>>n;
for(i=1;i<=n;i++) f>>x[i];
for(st=1;st<=n;st++)
{
s=0;
for(dr=st+1;dr<=n;dr++)
{
s=s+x[dr];
if(s>max) {max1=st+1; max2=dr;max=s;}
}
}
g<<max<<' '<<max1<<' '<<max2;
f.close();
g.close();
return 0;
}