Cod sursa(job #2462230)
Utilizator | Data | 26 septembrie 2019 21:51:46 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,i,j,mx,mx1,t,l,x,sum,s,smx,d;
unsigned long long int v[100001];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
mx=-1000000000;
for(i=1; i<=n; i++)
{
f>>x;
if(sum<0)
{
sum=x;
s=i;
}
else
sum=x+sum;
if(mx<sum)
{
mx=sum;
smx=s;
d=i;
}
}g<<mx<<" "<<smx<<" "<<d;
}