Cod sursa(job #1184855)
| Utilizator | Data | 14 mai 2014 11:55:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <limits.h>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int s[7000005];
int main()
{int bst=-INT_MAX, mini=0,inc,sf,i,n,ind;
in>>n;
for(i=1;i<=n;i++)
in>>s[i];
for(i=1;i<=n;i++)
{
s[i]+=s[i-1];
if(bst<s[i]-mini)
{bst=s[i]-mini; inc=ind+1 ;sf=i;}
if(mini>s[i])
ind=i,mini=s[i];
}
out<<bst<<" "<<inc<<" "<<sf<<'\n';
return 0;
}
