Cod sursa(job #1010917)
Utilizator | Data | 15 octombrie 2013 21:25:34 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,x,s[6000002],poz,maxim,p,u,i;
int main()
{
f>>n>>x;
s[1]=x;
maxim=x;
p=1;
u=1;
for(i=2;i<=n;i++)
{
f>>x;
if(x>x+s[i-1])
{
s[i]=x;
poz=i;
}
else
s[i]=x+s[i-1];
if(s[i]>maxim)
{
maxim=s[i];
p=poz;
u=i;
}
}
g<<maxim<<" "<<p<<" "<<u;
return 0;
}