m0_57830107的博客

Given a sequence ofKintegers {N1​,N2​, ...,NK​}. A continuous subsequence is defined to be {Ni​,Ni+1​, ...,Nj​} where1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which has the largest sum of its elements. For example, given se...

At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in's and out's, you are supposed to find the ones who have unlocked and lo.

#include<stdio.h>int main(){ int k,t; int count = 0; float c[10001] = {0}; float m; scanf("%d", &k); //多项式的指数就当作数组下标记录系数的索引 for(int i = 0; i < k; i++){ scanf("%d %f", &t, &m); c[t] += m; ...

#include <iostream>#include<string.h>using namespace std;int main() { int a, b; cin >> a >> b; string s = to_string(a + b); int len = s.length(); for (int i = 0; i < len; i++) { cout << s[i];...

#include<iostream>using namespace std;int main(){ long long int n,sum=0; cin>>n; while(n){ int m=n%10; sum+=m; n/=10; } string b[10]={"zero","one","two","three","four","five","six","seven","eight","...

#include<iostream>using namespace std;int main(){ int n; cin>>n; int m[n+1]; m[0]=0; for(int i=1;i<n+1;i++){ cin>>m[i]; } int time=0; for(int i=1;i<n+1;i++){ if(m[i]>m[i-1]){ ...