#include <iostream> #include <algorithm> using namespace std; int main() { int n,k; int a[100010]; int sum; //n = 5; //k = 5; cin >> n ; for(int i = 0; i < n; i++) { cin >> a[i]; } cin >> k; int count = 0; int maxcount=0; int len[100010]; for(int i = 0; i < n; i++) { if((n-i)<maxcount) { break; } sum = 0; for(int j = i; j < n; j++) { sum += a[j]; if(sum%k == 0){ count = j - i + 1; } if(count>maxcount) { maxcount=count; } } } cout << maxcount; return 0; }
