Compilare: main.cpp:1:27: warning: extra tokens at end of #include directive #include <bits/stdc++.h> #define MAXN 107171 #define MAXR 371 using namespace std; ifstream fi("cumainilecurate.in"); ofstream fo("cumainilecurate.out"); int n, m, rad, A[MAXN]; vector<int> L[MAXR]; void gen(int seg) { L[seg].clear(); int dr = min(seg * rad, n), st = (seg-1) * rad + 1; for(int i = st; i <= dr; ++i) if(L[seg].empty() || L[seg].back() <= A[i]) L[seg].push_back(A[i]); } int query(int poz) { /// ducem manual solutia pana la un multiplu de rad int ma = A[poz], re = 1; while(poz < n && poz % rad) { ++poz; if(A[poz] > ma) { ma = A[poz]; ++re; } } if(poz == n)return re; //sarim din radical in radical pana la sol int dl = 0; for(int seg = poz/rad + 1; (seg-1)*rad+1 <= n; ++seg) { auto it = upper_bound(L[seg].begin(), L[seg].end(), ma); dl = L[seg].end() - it; re += dl; ma = max(ma, L[seg].back()); } return re; } int main() { fi >> n >> m; rad = min((int)(sqrt(double(n))*2.+.5), n/2); for(int i = 1; i <= n; ++i) fi >> A[i]; for(int i = 1; i <= (n-1)/rad+1; ++i) gen(i); int tip, poz, val; for(int i = 1; i <= m; ++i) { fi >> tip >> poz; if(tip == 1) { fi >> val; A[poz] = val; gen((poz-1)/rad + 1); } else fo << query(poz) << "\n"; } return 0; } #include <bits/stdc++.h> ^ main.cpp: In member function 'void InputReader::advance()': main.cpp:44:51: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result] for(int i = st; i <= dr; ++i) ^ main.cpp: In constructor 'InputReader::InputReader(const char*)': main.cpp:22:47: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)', declared with attribute warn_unused_result [-Wunused-result] return *this; ^