Cod sursa(job #1114002)
Utilizator | Data | 21 februarie 2014 09:47:55 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{int n,k,max=0,s=0,i,c=1,p,u;
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
int v[n+1];
for (i=1;i<=n;i++)
f>>v[i];
{for (i=c;i<=n;i++)
{s=v[i]+s;
if (s>max)
{max=s;
p=c;
u=i;}
if (s<1)
{s=0;
c=i+1;}}}
g<<p<<" "<<u<<" "<<max;
return 0;
}