Cod sursa(job #1690998)
Utilizator | Data | 16 aprilie 2016 15:56:23 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <deque>
using namespace std;
int n,i,s,min1=99999999,max1=0,l,c,x,v;
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
s=s+x;
if(s<min1){min1=s;l=i;}
if(s>max1){max1=s;c=i;}
}
v=max1-min1;
l++;
g<<v<<" "<<l<<" "<<c;
return 0;
}