Cod sursa(job #460138)
| Utilizator | Data | 1 iunie 2010 12:16:10 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int N,K,p;
int start,end;
long long best = -50000000;
long long minim = 50000000;
long long S;
long nr;
int main ()
{
int i;
in>>N>>K;
for(i=1;i<=N;i++)
{
in>>nr;
S+=nr;
if(S-minim>best)
{
best = S-minim;
end = i;
start = p+1;
}
if(S<minim)
minim=S,p=i;
}
out<<start<<' '<<end<<' '<<best;
return 0;
}