Cod sursa(job #460083)
Utilizator | Data | 1 iunie 2010 10:44:16 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
long long s,minim=1500000,maxim=-15000000,N;
int main ()
{
int i,p1,p2;
long long nr;
in>>N;
for(i=1;i<=N;i++)
{
in>>nr;
s+=nr;
if(s<minim)
{
minim=s;
p1=i;
}
if(s>maxim)
{
maxim=s;;
p2=i;
}
}
out<<maxim-minim<<' '<<p1+1<<' '<<p2;
return 0;
}