Cod sursa(job #1799552)
| Utilizator | Data | 6 noiembrie 2016 14:30:07 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 95 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001],n,i,maxist,maxidr,minist;
long long maxi,mini,s;
int main()
{
fin>>n;
mini=0;
minist=0;
for(i=1;i<=n;i++)
{
fin>>v[i];
v[i]+=v[i-1];
if(mini>v[i-1])
{
mini=v[i-1];
minist=i-1;
}
s=v[i]-mini;
if(s>maxi)
{
maxi=s;
maxist=minist+1;
maxidr=i;
}
}
fout<<maxi<<" "<<maxist<<" "<<maxidr;
fin.close();
fout.close();
return 0;
}
