Cod sursa(job #2191684)
Utilizator | Data | 3 aprilie 2018 13:54:42 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,j,x,s,v[6000001],a,b,d,maxim=-2147483648, minim=2147483647;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
s+=x;
v[i]=s;
if(v[i]<minim) {minim=v[i]; a=i+1;}
if(v[i]>maxim) {maxim=v[i]; b=i;}
}
g<<maxim-minim<<' '<<a<<' '<<b;
}