Cod sursa(job #1961040)
Utilizator | Data | 10 aprilie 2017 20:56:50 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 35 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,suma[60000],v[60000],i,j,max,max1,max2,c=0,s;;
fstream f("ssm.in",ios::in);
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
f.close();
suma[0]=0;
for(i=1;i<=n;i++)
{
suma[i]=suma[i-1]+v[i];
}
for(i=2;i<=n;i++)
{
for(j=i;j<=n;j++)
{
s=suma[j]-suma[i-1];
if((c==1)&&(s>max))
{
max=s;
max1=i;
max2=j;
}
if(c==0)
{
max=s;
max1=i;
max2=j;
c++;
}
}
}
fstream g("ssm.out",ios::out);
g<<max<<" "<<max1<<" "<<max2;
g.close();
}