Ocenuvanje

@MOI

sakam detalno reshenie za zadacava deka ne go razbiram kodot od wikito

Имаш колешка што ја решила задачата. Прашај ја неа

This message was edited 4 times. Last update was at 08/04/2012 17:21:58

ne mi treba objasnuvanje, reshenieto sto sum go pratil tocno, samo sum koristel "int" namesto "long long", a broevite nadminuvale 2^32 xD

//ova e smenatiot kod:

/*
ID: kliment3
LANG: C++
TASK:
*/
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <cstring>
#include <string>
#include <sstream>
#include <algorithm>
#include <fstream>
#include <math.h>
#include <time.h>
#include <cmath>
#include <map>
#include <iomanip>
#define pb push_back
#define mp make_pair
#define P push
#define MAX 2139062143
#define NUM 50
//#define fout cout
//#define fin cin
using namespace std;
//ifstream fin(".in");
//ofstream fout(".out");

vector<long long> niz;
int n;
long long presmetaj(int k){
    long long ret=0;
    long long o=niz[k];
    for(int i=0;i<=k;i++){
        ret+=min(niz[i], o);
    }
    for(int i=k+1;i<n;i++)
        ret+=min(niz[i], o-1);
    return ret;
}
int main(){

long long k;
	cin >> n >>k;
	for(int i=0;i<n;i++){
	    long long a;
	    cin >> a;
	    niz.pb(a);
	}
	long long rez[n+1], kraj=0;;
	for(int i=0;i<n;i++){
	    rez[i]=presmetaj(i);
	    if(rez[i]>k)kraj++;
	}
	cout << kraj;
	return 0;
}

Ja i ti pravo u kafana da se ispijancime da gi potopime nasite mizerii :S:S:S

Ja i ti pravo u kafana da se ispijancime da gi potopime nasite mizerii :S:S:S

This message was edited 1 time. Last update was at 08/04/2012 17:47:52

ne ne izlagira... XD